← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

20 第20章 基本图算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.723Z

hat G has strongly connected components C1, C2, … , Ck. The vertex set VSCC is {v1, v2, …

, vk}, and it contains one vertex vi for each strongly connected component Ci of G. There is an edge (vi, vj) ∈ ESCC if G contains a directed edge (x, y) for some x ∈ Ci and some y ∈ Cj.

Looked at another way, if we contract all edges whose incident vertices are within the sa

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea