This project implements various algorithms for solving the maximum flow problem in network graphs. The implemented algorithms include Shortest Augmenting Path (SAP), DFS-like, Max-Capacity (MaxCap), and Random Path.

• Python 3.12.0
• Required Python packages (only inbuilt python libraries are used)
• ASCII encodings of all your source-sink graphs as input to your simulation code, one file per graph. (provided in the repo file)

1. Pull the code with git pull.
2. Navigrate to the project folder with executable files.

python algo_project.py