说明：  图的连通性判断。本次实验要求用计算机语言编写图的连通性判断算法，可输入图的邻接矩阵，判断图是否连通以及确定连通分支的个数，使学生掌握Warshell算法或矩阵幂算法的实现方法，培养算法设计与优化能力。
(The experiment requires written in a computer language to determine the connectivity graph algorithms, you can enter the adjacency matrix to determine whether the connectivity map and determine the number of connected components enable students to master algorithm or method Warshell matrix power algorithm, algorithm design culture and optimization capabilities.)