pub fn parallel_max_flow<N, E, Ix>( graph: &DiGraph<N, E, Ix>, source: &N, sink: &N, ) -> Result<f64>where N: Node + Clone + Send + Sync + Debug, E: EdgeWeight + Into<f64> + Copy + Send + Sync + Debug, Ix: IndexType + Send + Sync,
Parallel maximum flow algorithm