Push–relabel maximum flow algorithm: Difference between revisions

Revision as of 18:42, 21 November 2017

Revision as of 22:35, 23 December 2017

Line 389:

height[source] = n # longest path from source to sink is less than n long

excess[source] = Inf∞ # send as much flow as possible to neighbours of source

for v in xrange(n):

push(source, v)