Ford Fulkerson algorithm for undirected graphs written in java
This is just the first version of ford fulkerson algo implemented for undirected graphs in java. Requires refactoring and algo improvements.
References:
http://stackoverflow.com/questions/7687732/maximum-flow-ford-fulkerson-undirected-graph
http://www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/
http://stackoverflow.com/questions/26682894/bi-directional-maximum-flow-using-ford-fulkerson http://math.stackexchange.com/questions/677743/finding-the-max-flow-of-an-undirected-graph-with-ford-fulkerson