由邻接矩阵求解强分图

Solution to Strong Component by means of Adjacency Matrix

从图在计算机中的基本表示方式——邻接矩阵出发,给出求解图的邻接矩阵、路径矩阵、强分图的算法。该算法结构简单、形式统一,有一定实用价值。

This paper gives the algorithm for solving adjacency matrix path matrix and strong component,starting from the mathematical expression of graph-adjacency matrix.