文件名称:The-graph-traversing-algorithm
介绍说明－－下载内容均来自于网络，请自行研究使用
以邻接矩阵或邻接表为存储结构，以用户指定的顶点为起始点，实现无向连通图的深度优先及广度优先搜索遍历，并输出遍历的结点序列-The adjacency matrix or adjacency list for the storage structure to user-specified vertex as a starting point to achieve a connected undirected graph of the depth-first and breadth-first search traversal, and the output node traversal sequence
(系统自动生成,下载前可以参看下载内容)
下载文件列表
The graph traversing algorithm.doc