I am given a directed network graph with three fixed verticess where two of these are "inputs" and and one is the "sink". I'm asked to find the maximal flow through the network. How should go about doing this?
I'm familiar with the Ford–Fulkerson algorithm but can it be used when I have two distinct inputs?
How can I get started?