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?
Make a vertex that is the source of the two inputs, and connect this vertex with the input vertices in your problem. Then apply a suited algorithm.