Max flow using Edmonds–Karp algorithm

A Java program made to find the Maximum Flow that can be passed through a Flow Network.

Input method

Inputs are taken from a text file format which can be located inside src/benchmarks that has the number of nodes at the first line and after that each line represents the starting node, ending node and the capacity of the edge between those two nodes.

Prerequisites

• Java JDK 8
• IntelliJ IDEA

Steps to run locally

1. Run the Main.java inside src folder
2. You can change what file you want to read inside src/benchmarks or add your own flow network file