← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

第六部分 图算法

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

ed acyclic graph and decomposing a directed graph into its strongly connected components.

Chapter 21 describes how to compute a minimum-weight spanning tree of a graph: the least-weight way of connecting all of the vertices together when each edge has an associated weight.

The algorithms for computing minimum spanning trees serve as good examples of greedy algo

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea