Function multi_source_multi_sink_max_flow 

pub fn multi_source_multi_sink_max_flow<N, E, Ix>(
    graph: &DiGraph<N, E, Ix>,
    sources: &[N],
    sinks: &[N],
) -> Result<f64>
where
    N: Node + Clone + Debug,
    E: EdgeWeight + Into<f64> + Copy + Debug,
    Ix: IndexType,

Multi-source multi-sink maximum flow.

Creates a super-source and super-sink connected to all sources/sinks with infinite capacity, then solves the single-source single-sink problem.