Revision as of 12:34, 27 November 2013 edit Drrilll (talk \| contribs) 95 edits →Relabel-to-Front ← Previous edit		Revision as of 12:37, 27 November 2013 edit undo Drrilll (talk \| contribs) 95 edits →Relabel-to-Front Algorithm (FIFO heuristic) Next edit →
Line 107: particular order (they will be put in order as the algorithm executes). In addition to this master list, each vertex maintains a list of its neighbours in the graph, in arbitrary but static order. These neighbours are the vertices it ~~will attempt~~can topotentially push flow to. Then, starting at the first vertex, we ''Discharge'' a vertex <math>u \in L </math> if it is active. Discharge is detailed below:

Push–relabel maximum flow algorithm: Difference between revisions