= Push–relabel maximum flow algorithm
{wiki=Push–relabel_maximum_flow_algorithm}
The Push-Relabel maximum flow algorithm is a method used for solving the maximum flow problem in a flow network. A flow network consists of a directed graph where each edge has a capacity and the goal is to determine the maximum possible flow from a designated source node to a designated sink node while respecting these capacities. \#\#\# Key Concepts: 1. **Flow Network**: A directed graph where each edge has an associated non-negative capacity. The flow must not exceed these capacities.
Back to article page
