← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

7, the algorithm never chooses the augmenting path with the fewest edges. It should have.

By using breadth-first search to find an augmenting path in the residual network, the algorithm runs in polynomial time, independent of the maximum flow value. We call the Ford-Fulkerson method so implemented the

Edmonds-Karp algorithm. Let’s now prove that the Edmonds-Karp algorithm runs in O(VE2) ti

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea