Network Flow Empirical Study

Authors: Megan Boggess, Jordan Hanna, James Marquardt

Compares run time of Ford Fulkerson, Ford Fulkerson with Capacity Scaling, and Preflow Push algorithms for calculating max-flow in a network.

To compile:

$ javac *.java

To run:

$ java RunMaxFlow path/to/input/graph

Note that input graphs must be in the space delimited form: nodename nodename capacity