Function petgraph::algo::condensation[][src]

pub fn condensation<N, E, Ty, Ix>(
    g: Graph<N, E, Ty, Ix>,
    make_acyclic: bool
) -> Graph<Vec<N>, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType

Graph Condense every strongly connected component into a single node and return the result.

If make_acyclic is true, self-loops and multi edges are ignored, guaranteeing that the output is acyclic.