资 源 简 介
以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-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.
