Max Flow using Ford Fulkerson


Algorithm

Find a path from the source to sink
run the maximum flow you can through that path
create residual flow in the opposite direction
repeat until there are no more paths from source to sink

Code
MaxFlow.java
Node.java
Edge.java
Graph.java
MainApplet.java