pub fn condensation<N, E, Ty, Ix>(
g: Graph<N, E, Ty, Ix>,
) -> Graph<Vec<N>, E, Ty, Ix> where
Graph Condense every strongly connected component into a single node and return the result.
make_acyclic is true, self-loops and multi edges are ignored, guaranteeing that
the output is acyclic.