← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

第六部分 图算法

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

and Chapter 23 examines methods to compute shortest paths between every pair of vertices.

Chapter 24 shows how to compute a maximum flow of material in a flow network, which is a directed graph having a specified source vertex of material, a specified sink vertex, and specified capacities for the amount of material that can traverse each directed edge.

This general problem arises in many forms, and a good algorithm for computing maximum flo

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea