Push–relabel maximum flow algorithm
FIFO selection rule

The FIFO push–relabel algorithm organizes the active nodes into a queue. The initial active nodes can be inserted in arbitrary order. The algorithm always removes the node at the front of the queue for discharging. Whenever an inactive node becomes active, it is appended to the back of the queue.

The algorithm has O (V) time complexity.
change_case:english_lowercase, length_constraints:number_paragraphs[5]