As in the previous exercise, let f (u, ) be the distance from u to
Question:
As in the previous exercise, let δf (u, ν) be the distance from u to ν in the residual network Gf. Show how to modify the generic push-relabel algorithm to maintain the property that u.h < |V| implies u.h = δf (u, t) and that u.h ≥ |V| implies u.h ≥ |V| = δf (u, s). The total time that your implementation dedicates to maintaining this property should be O(VE).
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Question Posted: