... 连通分量(Connected Component) 强连通图(Strongly Connected Graph) 在有向图中,若每对顶点Vx到Vy ...
基于856个网页-相关网页
·2,447,543篇论文数据，部分数据来源于NoteExpress
若有向图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.
应用推荐