以用户指定的结点为起点，分别输出深度优先遍历和广度优先遍历下的结点访问序列和相应生成树的边集-As a starting point to a user-specified node, respectively, to output the depth-first and breadth-first traversal node access to the sequence and the corresponding set of edges of the spanning tree

无向图的遍历，深度优先遍历，广度优先遍历。-Undirected graph traversal, depth-first traversal, breadth-first traversal.

广度优先遍历实验报告 供初学者参考,通过对该系统的设计,不错(Breadth-first traversal experiment report For beginners reference, through the design of the system, good)

广度优先遍历实验报告 供初学者参考,通过对该系统的设计,不错()