Edmonds-Karp
← Back to Network Flow
An implementation of the Ford-Fulkerson method that uses BFS to find the shortest augmenting path. Guarantees O(V * E^2) time complexity and always terminates, even with irrational capacities.
← Back to Network Flow
An implementation of the Ford-Fulkerson method that uses BFS to find the shortest augmenting path. Guarantees O(V * E^2) time complexity and always terminates, even with irrational capacities.