这个根结点是在深搜时碰到当前强连通分量的第一个结点。
The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
若有向图D中任何两个顶点是互相可达的，则称D为强连通图。
A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.
本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph.
应用推荐