Kruskal最小生成树算法一、　　实验目的
1、　　掌握图的邻接表结构
2、　　掌握最小生成树算法
二、　　实验内容
基于邻接表实现kruskal算法(Kruskal minimum spanning tree algorithm, the purpose of the experiment
1. Master the adjacency list structure of the graph
2, master the minimum spanning tree algorithm
Two, experimental content
Implementation of Kruskal algorithm based on adjacency list)