← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

21 第21章 最小生成树

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

ight function is w : E → ℝ, and suppose that |E| ≥ |V| and all edge weights are distinct.

We define a second-best minimum spanning tree as follows. Let T be the set of all spanning trees of G, and let T be a minimum spanning tree of G. Then a second-best minimum spanning tree is a spanning tree T′ such that w(T

′) = min {w(T″) : T″ ∈ T − {T}}. a. Show that the minimum spanning tree is unique, but tha

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea