使用VC建立无向图的邻接表。再通过简单的打印函数遍历整张图，输入各个节点信息。-Establish the adjacency link of the no direction graph based on VC. And then prints the whole graph through the simple print function, and outputs the information of all the nodes.

1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索，按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit