Revision as of 02:57, 3 December 2014 edit AManWithNoPlan (talk \| contribs) Extended confirmed users 100,078 edits →References: fix international characters ← Previous edit		Revision as of 08:58, 3 December 2014 edit undo Kxx (talk \| contribs) Extended confirmed users 3,386 edits m →Initialization Next edit →
Line 60: ====Initialization==== The algorithm starts by creating a residual graph, initializing the preflow values to zero and performing a set of saturating push operations on residual edges exiting the source, {{nowrap\|(''s'', ''v'') where ''v'' ∈ ''V'' \ {''s''}}}. Similarly, the label heights are initialized such that the height at the source is in the number of vertices in the graph, {{nowrap\|''h''(''s'') {{=}} {{!}}''V''{{!}}}}, and all other vertices are given a height of zero. Once the initialization is complete, the algorithm repeatedly performs either the push or relabel operations against active vertices until no applicable operation can be performed. ====Push====

Push–relabel maximum flow algorithm: Difference between revisions