← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

24 第24章 最大流

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

(u, v) = 0. We call the nonnegative quantity f (u, v) the flow from vertex u to vertex v.

The value |f | of a flow f is defined as that is, the total flow out of the source minus the flow into the source. (Here, the |·| notation denotes flow value, not absolute value or cardinality.) Typically, a flow network

does not have any edges into the source, and the flow into the source, given by the summa

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea