强连通分量
Sign in to savesubgraph of a directed graph containing paths in both directions between each pair of vertices
Wikidata facts
- Subclass of
- connected component of a graph
- Image
- Strongly connected digraph.svg
Show 2 more facts
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- graph theory
Sources (2)
via Wikidata · CC0
Article · 中文
在有向图的数学理论中，如果一个图的每一个顶点都可从该图其他任意一点到达，则称该图是强连通的。在任意有向图中能够实现强连通的部分我们称其为强连通分量。判断一个图是否为强连通以及找到一个图强连通分量只需要线性时间（Θ(V + E)）。
Abstract from DBpedia / Wikipedia · CC BY-SA