tubianli
所属分类:C#编程
开发工具:Visual C++
文件大小:81KB
下载次数:78
上传日期:2006-07-11 23:10:26
上 传 者:
dowonders
说明: 以邻接表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。
(table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the output of each traverse the nodes visit Spanning Tree sequence and the corresponding set of edges.)
文件列表:
图遍历的演示\图遍历的演示.cpp (4861, 2005-07-14)
图遍历的演示\图遍历的演示.doc (102912, 2005-07-14)
图遍历的演示\图遍历的演示.exe (167981, 2005-07-14)
图遍历的演示 (0, 2005-07-15)
近期下载者:
相关文件:
收藏者: