原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
rithms that use this rule to find safe edges efficiently. We first need some definitions.
Acut (S, V – S) of an undirected graph G = (V, E) is a partition of V. Figure 21.2 illustrates this notion. We say that an edge (u, v) ∈ Ecrosses the cut (S, V – S) if one of its endpoints belongs to S and the other belongs to
V – S. A cut respects a set A of edges if no edge in A crosses the cut. An edge is a ligh
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea