Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component 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 connected components
a graph with vertex attributes containing the smallest vertex in each connected component