Network flow in graphs Given all input resources are unlimited what is the maximum flow that can be achieved through the graph.