This project is a Java implementation of the Edmonds-Karp algorithm — a classic method for computing the maximum flow in a flow network. It uses Breadth-First Search (BFS) to find augmenting paths and ...

There are some related papers proposed. Some use genetic algorithm (GA), but the solution may be wrong. Some use depth first search (DFS) algorithm, which is an exhaustive search, the execution speed ...