Maximum Flow (Push-Relabel)  ›  the sequential cascade, written from the pseudocode

Not derived from the parallel cascade — written the way you would write while there is an active vertex: pick one, then push or relabel. The test is taken once, before anything is written, so every round is exactly one operation: 29 rounds, 29 operations, the same 29 the textbook performs, in the same order. Steps marked changed are where this cascade differs from the parallel one: a selector added, four Einsums adjusted, and two dropped — the post-push recomputations that only bulk-synchronous execution needs. (A third cascade keeps those recomputations and gates the parallel list with a selector; it is correct, but evaluates both arms every round and so packs the same 29 operations into 26 rounds.)