原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
vertex whose removal disconnects G. A bridge of G is an edge whose removal disconnects G.
A biconnected component of G is a maximal set of edges such that any two edges in the set lie on a common simple cycle. Figure 20.10 illustrates these definitions. You can determine articulation points, bridges, and biconnected components
using depth-first search. Let Gπ = (V, Eπ) be a depth-first tree of G. a. Prove that the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea