若有向图D中任何两个顶点是互相可达的，则称D为强连通图。
A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.
现在有一些文献对有向图的强连通分量做了一些讨论，一般采用了递归的方法。
Many documents and papers nowadays have discussed the strong connected component of the directed graph, and the method they adopted is usually Recursion.
本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
然后将无冲突可重复网的极小活标识的配置化为强连通-T图极小活标识的配置。
The second, the assignment of minimal live marking for choice-free repetitive Petri net is transformed into the assignment of minimal live marking for the strong connective T graph.
然后将无冲突可重复网的极小活标识的配置化为强连通-T图极小活标识的配置。
The second, the assignment of minimal live marking for choice-free repetitive Petri net is transformed into the assignment of minimal live marking for the strong connective T graph.
应用推荐