Edmonds-karp algorithm for finding the maximum flow
Computer Science
1. Edmonds-Karp algorithm for finding the maximum flow of O (NM 2 )
2. Method push predpotoka finding maximum flow of O (N 4 )
3. Modified method for pushing predpotoka O (N 3 )
4. Feed restrictions
5. The flow of minimal cost (min-cost-flow). Algorithm for ways to increase the O (N 3 M)
All of these are algorithms
