| 释义 |
1 [数]?强连通图 ... 连通分量(Connected Component) 强连通图(Strongly Connected Graph) 在有向图中,若每对顶点Vx到Vy ... 2 ?强连通的 如果中任意两结点都互相可达,则称是强连通的(Strongly Connected Graph),例如在..
- 1
Based on the algorithm to find strongly connected nodes of a graph, this paper presents a linear time algorithm to detect modules of a fault tree. 基于在图中寻找强连接节点的算法，给出一种线性时间复杂度算法来检测故障树中的模块。 - 2
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components. 算法的输入是一个有向图，产生一个图的强连通分量顶点划分。 - 3
In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph. 本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
|