Content deleted Content added
Line 108:
list, each vertex maintains a list of its neighbours in the graph, in arbitrary but static order.
These neighbours are the vertices it can potentially push flow to. Then, starting at the first
vertex in the list and moving to each in turn, we ''Discharge'' a vertex <math>u \in L </math> if it is active. If a vertex is relabelled during discharge, it is moved to the front of the list, and we start again at the next vertex (formerly the first vertex). Discharge is detailed below:
===Discharge===
| |||