CS 6301.502. Implementation of advanced data structures and algorithms
Fall 2017
Long Project 7: Maximum flow problem
Thu, Nov 9, 2017

Version 1.0: Initial description (Thu, Nov 9).

Due: 1st deadline: 11:59 PM, Sun, Nov 26. Final deadline: 11:59 PM, Sun, Dec 10.

Max marks: 100 (100 points for each part). 
Maximum excellence credit: 10 (5 points for each part).
Criteria for allocation of EC: 1st deadline submission, good design,
good-quality code, correct outputs, fast RT, code reuse from previous projects.
Best 15 projects can earn up to 10 EC each.

Starter code is provided.
Do not change the name of the class or move it away from cs6301/gXX.
You can keep other source files in subfolders, if you wish to do so.
Do not change the signatures of public methods in the starter code.


Part a. Implement Dinitz's algorithm for maximum flow.

Part b. Implement Relabel-to-front algorithm for maximum flow.