Flows

Ford-Fulkerson

max_flow(G, s, t)	Find a maximum single-commodity flow using the Ford-Fulkerson
min_cut(G, s, t)	Compute the value of a minimum (s, t)-cut.
ford_fulkerson(G, s, t)	Find a maximum single-commodity flow using the Ford-Fulkerson