BFs-based--Max-flow-solver

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 is a practical application of graph theory and network flow.