知识卡片
强连通按双向可达
有向图强连通要求任意两个顶点彼此可达。
强连通分量按互相可达的等价类划分;只有从u到v的单向路径不足以让二者落在同一分量。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
- · 强连通按双向可达
原书出处 · 1 处
- 附录B 集合等离散数学基础 · 查看原书依据
A directed graph is strongly connected if every two vertices are reachable from each other. The strongly connected components of a directed graph are the equivalence classes of vertices
参考来源
- 位置:《算法导论(第4版)》附录B《集合等离散数学基础》(OEBPS/appendix002.xhtml,文本字符[25000,30000))。
- 结论依据:附录B图、树的定义及相关例子;图B.2–B.5和对应公式图已查看。
- 原始内容:A directed graph is strongly connected if every two vertices are reachable from each other. The strongly connected components of a directed graph are the equivalence classes of vertices