← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

第五部分 高级数据结构

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

of the dictionary operations and are mentioned in the chapter notes throughout this book.

Dynamic graph data structures support various queries while allowing the structure of a graph to change through operations that insert or delete vertices or edges. Examples of the queries that they support include vertex connectivity [214], edge connectivity, minimum spanning trees [213], biconnectivity, and transitive closure

[212]. Chapter notes throughout this book mention additional data structures.

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea