原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
owever: it violates the original assumption that if edge (v1, v2) ∈ E, then (v2, v1) ∉ E.
We call the two edges (v1, v2) and (v2, v1) antiparallel. Thus, to model a flow problem with antiparallel edges, the network must be transformed into an equivalent one containing no antiparallel edges. Figure
24.2(b) displays this equivalent network. To transform the network, choose one of the two
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea