文件名称:graph_C(1)
介绍说明－－下载内容均来自于网络，请自行研究使用
建立无向图的邻接矩阵存储；对已经建立的无向图进行深度优先和广度优先遍历操作。建立有向图的邻接表存储；对已经建立的有向图进行深度优先和广度优先遍历操作。
-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.
-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.
相关搜索： 广度优先遍历
(系统自动生成,下载前可以参看下载内容)
下载文件列表
graph_C\单源最短路径之dijkstra.txt
.......\判断从p到q存在一条简短路径.txt
.......\判断无向图的连通性.txt
.......\无向连通图的BFS遍历.txt
.......\无向连通图的DFS遍历.txt
.......\最小生成树之kruskal.txt
.......\最小生成树之prim算法.txt
graph_C
.......\判断从p到q存在一条简短路径.txt
.......\判断无向图的连通性.txt
.......\无向连通图的BFS遍历.txt
.......\无向连通图的DFS遍历.txt
.......\最小生成树之kruskal.txt
.......\最小生成树之prim算法.txt
graph_C