← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

19 第19章 不相交集合的数据结构

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

rent-child relationships but nevertheless allows you to determine any node’s depth in Ti.

The key idea is to maintain in each node v a “pseudodistance” v.d, which is defined so that the sum of the pseudodistances along the simple path from v to the root of its set Si equals the depth of v in Ti.

That is, if the simple path from v to its root in Si is v0, v1, … , vk, where v0 = v and

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea