pub fn kosaraju(
graph: impl RandomAccessGraph,
transpose: impl RandomAccessGraph,
pl: &mut impl ProgressLog,
) -> Sccs
Expand description
Computes the strongly connected components of a graph using Kosaraju’s algorithm.
§Arguments
-
graph
: the graph. -
transpose
: the transpose ofgraph
. -
pl
: a progress logger.