Network flow can be solved
- Maximum bipartite graph matching (capacity of each edge is set to the network 1)
- Multiple match ()
Algorithm for maximum flow network flow
- Edmonds-karp augmenting path algorithm A \ (O (n-m ^ {2}) \)
- dinic algorithm
1. Find a path from source to sink in the map (referred to as 'augmenting paths').
2. Take the remaining amount by the minimum wide road v. (That is, the flow path flows in the smallest that a)
3. The answer plus v.
Residual all sides of the augmented road minus 4 ,. v, the reverse side of the residual amount plus v.