Content deleted Content added
Line 128:
for each vertex v incident to s:
push(s,v); //note that this will saturate the edges (s,v), since the flow from s is limitless
L = v - {''s'',''t''}; //build a list of all vertices in any order
current = L.head;
while (current != NIL):
| |||