以用户指定的结点为起点，分别输出深度优先遍历和广度优先遍历下的结点访问序列和相应生成树的边集-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

这份代码是一个深度搜索图的实例代码，但是效率不是很高，只能实现深度优先的遍历-The code is written for DFS to search for the answers! enjoy it please everybody.I use this stage at the first time.

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