Maximum Flow Problem

Introduction

A Java implementation of the shortest augmenting path algorithm and three preflow-push algorithms that solve the maximum flow problem:

• Abstract Algorithm
  • Shortest Augmenting Path Algorithm
  • Abstract Preflow Push Algorithm
    • Queue
    • Stack
    • Maximum Distance Label Chosen

Moreover, the repository also includes an algorithm analysis report that describes the implementation details, performance comparison, and how to run or test the algorithms.

Other

The project itself is my coursework for MA446 at Rose-Hulman Institute of Technology.