This was our algorithms course project at FCIS Ain Shams University.

This project aims to analyze and compare three famous network flow algorithms which are Edmonds Karp, Ford Flukerson and Dinic. We have also reviewed A Fast Network Flow Algorithm scientific paper.

To generate the test cases for this project we used testlib.h which is used in many competitive programming competitions to generate the test cases. To get the correct answer to the test cases I used a recent submit I did in Data Structures And Algorithm Specialization where you can find my submit at my GitHub Repository for all my submitions in it.

To obtain the same results from the statistical analysis of the run time please follow the steps here and run the first hundred test cases. After that open the notebook and run all the cells.

This project was under the supervision of Dr. Ahmed Salah.