原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
satisfying the property. The following theorem gives the rule for recognizing safe edges.
Theorem 21.1 Let G = (V, E) be a connected, undirected graph with a real-valued weight function w defined on E. Let A be a subset of E that is included in some minimum spanning tree for G, let (S, V – S) be any cut of G that
respects A, and let (u, v) be a light edge crossing (S, V – S). Then, edge (u, v) is safe
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea