Function pathfinding::directed::edmonds_karp::edmonds_karp_sparse

pub fn edmonds_karp_sparse<N, C, IC>(
    vertices: &[N], 
    source: &N, 
    sink: &N, 
    caps: IC
) -> EKFlows<N, C> where
    N: Eq + Hash + Copy,
    C: Zero + Bounded + Signed + Ord + Copy,
    IC: IntoIterator<Item = ((N, N), C)>, 

Helper for the edmonds_karp function using adjacency maps for sparse graphs.