文件名称:graph
介绍说明－－下载内容均来自于网络，请自行研究使用
1. 分别以邻接矩阵和邻接表的存储结构建立图。
2. 分别对图进行深度优先遍历和广度优先遍历。
3. 求图中边的数目。
4. 求顶点0到图中其余每个顶点的最短路径。
-1, respectively, the adjacency matrix and adjacency list storage structure created map.
2, respectively, the graph depth-first traversal and breadth-first traversal.
3 Find the number of edges in the graph.
4 Find the vertex 0 to each of the remaining vertices graph shortest path.
2. 分别对图进行深度优先遍历和广度优先遍历。
3. 求图中边的数目。
4. 求顶点0到图中其余每个顶点的最短路径。
-1, respectively, the adjacency matrix and adjacency list storage structure created map.
2, respectively, the graph depth-first traversal and breadth-first traversal.
3 Find the number of edges in the graph.
4 Find the vertex 0 to each of the remaining vertices graph shortest path.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
图程序.doc