Description: Experimental requirements: (1) to understand the storage method: Figure the vertices and edges adjacency matrix and adjacency list (2) to understand graph traversal algorithm grasp the application (3) application of graph traversal algorithm to determine whether the graph connectivity between the two vertices the existence of the path.
To Search:
File list (Check if you may need any files):
图的遍历及应用\无向网.cpp
..............\图.doc
图的遍历及应用
Download