Description: Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage structures, especially proficient adjacency matrix and adjacency list storage structure 2, master graph depth-first traversal and breadth-first traversal algorithm 3, the traversal algorithm based on the design of other applications algorithms.
To Search:
File list (Check if you may need any files):
源代码6.txt
Download