Description: Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation. Establish a table to store the adjacency have already established the graph depth first and breadth-first traversal operation.
To Search:
File list (Check if you may need any files):
graph_C\单源最短路径之dijkstra.txt
.......\判断从p到q存在一条简短路径.txt
.......\判断无向图的连通性.txt
.......\无向连通图的BFS遍历.txt
.......\无向连通图的DFS遍历.txt
.......\最小生成树之kruskal.txt
.......\最小生成树之prim算法.txt
graph_C
Download