▍1. Graph
输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)
