原书出处
Introduction to Algorithms, Fourth Edition
24 第24章 最大流
s, v) by Lemma 24.7, we have δf′ (s, u) = δf′ (s, v) + 1 ≥ δf (s, v) + 1 = δf (s, u) + 2.
Consequently, from the time (u, v) becomes critical to the time when it next becomes critical, the distance of u from the source increases by at least 2. The distance of u from the source is initially at least 0.
Because edge (u, v) is on an augmenting path, and augmenting paths end at t, we know that
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter024.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea