← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

21 第21章 最小生成树

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

et C = (VC, EC) be a connected component (tree) in the forest GA = (V, A). If (u, v) is a

light edge connecting C to some other component in GA, then (u, v) is safe for A. Proof The cut (VC, V – VC) respects A, and (u, v) is a light edge for this cut. Therefore, (u, v) is safe for A. ▪ Exercises 21.1-1 Let (

u, v) be a minimum-weight edge in a connected graph G. Show that (u, v) belongs to some mi

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea