Max Flow Network (Edmonds-Karp Algorithm in Java)

📌 Overview

This project implements the Edmonds-Karp algorithm for computing the maximum flow in a directed network.
It was developed as part of the Algorithms: Theory, Design and Implementation coursework.

The project includes:

• A Graph representation with edges and capacities.
• An implementation of the Edmonds-Karp algorithm (BFS-based Ford-Fulkerson).
• Benchmark input files for testing performance on different network structures.

---

⚙️ Features

• Efficient BFS-based augmentation to compute max flow.
• Support for custom input benchmark files.
• Clear debug logging (optional).
• Example benchmark outputs for analysis.

---

🚀 How to Run

1. Clone the repository

mvn clean package
git clone https://github.com/Jaychafekar/MaxFlowNetwork.git
cd MaxFlowNetwork