说明：  图的操作 1、创建图类，存储结构使用邻接矩阵。 2、输入图的节点数n（不超过10个）、边数m，节点分别用1-n代表。 3、采用“起始节点，终止节点，权值”输入图的m条边，创建图。 4、输出最小生成树的所有边。输出格式采用“起始节点-终止节点:权值”，小的节点在前，大的节点在后，每个边独立一行输出，例如1-2:12是正确的，2-1:12是错误的。如果没有最小生成树，输出0-0:0
(Operation of Graphs 1. Create graph class and use adjacency matrix in storage structure. 2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively. 3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value". 4. Output all edges of the minimum spanning tree. The output format is "Starting Node-Terminating Node: Weight". Small Node is in front of big Node, and big Node is in behind. Each side has a single line of output. For example, 1-2:12 is correct and 2-1:12 is wrong. If there is no minimum spanning tree, output 0-0:0)