Ford Fulkerson Network Flow Algorithm Discussion

The program is really straight forward. If you have any questions, please feel free to reach out. Must be written in JAVA. Thanks!

Program 4
Problem Description
a)
Implement the Ford-Fulkerson Network Flow Algorithm for the following graph G with V vertices and E
edges (source is node 1 and destination/sink is node 8). Your graph must take in user input for V, E, and
capacities for each edge. The program should output the Max flow value and the flow paths selected to
reach the max flow value.
b) Conduct a system time computation of the program for varying edge weights. Discuss your observations.
(you can vary edge weights by multiples of 10, 100, 1000, etc)
A program heading in the following format should begin your program:
//==============================================================
// Network Flow Program
//==============================================================
//
//
//————————————————————–
Grading
Documentation
Style
Exception Handling
Correctness
10%
10%
10%
70%
What to Turn In
Upload your program and relevant files to bbweb.towson.edu by the deadline. No late submission will be accepted.
Reference:
http://www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/
1

attachment