原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
and assume that T does not contain the light edge (u, v), since if it does, we are done.
We’ll construct another minimum spanning tree T′ that includes A ∪ {(u, v)} by using a cut-and-paste technique, thereby showing that (u, v) is a safe edge for A. The edge (u, v) forms a cycle with the edges on the simple path p
from u to v in T, as Figure 21.3 illustrates. Since u and v are on opposite sides of the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea