In graph theory, a component, sometimes called a connected component, of an undirected graph is a subgraph in which any two vertices are connected to each other by paths. It is connected to no additional vertices in the supergraph (from wikipedia). The API computes the (weakly) connected component (CC) of each vertex and returns a graph with the vertex value containing the lowest vertex id in the CC containing that vertex.