文件名称:tubianli
介绍说明－－下载内容均来自于网络，请自行研究使用
以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To adjacent multi-table storage structure for connectivity undirected graph depth-first and breadth-first traversal. User-specified node as a starting point, respectively, under the output of each node traversal sequences and the corresponding spanning tree to access the edge set.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
实验四.doc