Compute the strongly connected component (SCC) of each vertex and return a graph with the vertex value containing the lowest vertex id in the SCC containing that vertex.
Compute the strongly connected component (SCC) of each vertex and return a graph with the vertex value containing the lowest vertex id in the SCC containing that vertex.
the vertex attribute type (discarded in the computation)
the edge attribute type (preserved in the computation)
the graph for which to compute the SCC
a graph with vertex attributes containing the smallest vertex id in each SCC
Strongly connected components algorithm implementation.