Howerer, the traditional algorithm of Reachability Matrix is comparative complicated, especially when there are more nodes in the Directed Graph, the arithmetic amounts are big and not enough simple.
而可达矩阵的传统求法比较复杂，尤其是有向连接图中节点较多的时候，运算量大，不够简便。
Howerer, the traditional algorithm of Reachability Matrix is comparative complicated, especially when there are more nodes in the Directed Graph, the arithmetic amounts are big and not enough simple.
而可达矩阵的传统求法比较复杂，尤其是有向连接图中节点较多的时候，运算量大，不够简便。
应用推荐