数据结构实验六图的操作，在程序中提示输入的顶点数以及每两条边之间的权值，最后使用深度优先和广度优先算法实现遍历，同时构建最小耗费生成树的最小权值和路径。-Experimental data structure diagram of the operation of six, in the program prompts for the number of vertices and edges between every two weights, the final depth-first and breadth-first traversal algorithm, while the minimum cost to build the minimum spanning tree and path weights .