Fix connected component algorithm implementation:

The algorithm is described in this paper: https://dl.acm.org/doi/pdf/10.1145/2670979.2670997

Summary of the algorithm: essentially, the algorithm is doing "large-star" and "small-star" transformations over the graph,
until convergence (i.e. the transformation doesn't change graph structure),

graph = input_graph  # input graph each node must has a unique and comparable label number
while (! converged) {
   graph = large_star(graph)
   graph = small_star(graph)
}

large star transformation:
For each node U, finding the neighbor nodes V that has larger label than node U, and finding the node M that has the minimal label in the set of {*node_U_neighbor_node_set, node_U}, for every node V, generate an edge from V to M, the generated edges compose of the "large star" transformation output graph.

small star transformation:
For each node U, finding the neighbor nodes V that has smaller label than node U, and finding the node M that has the minimal label in the set of node_U_neighbor_node_set, for every node V, generate an edge from V to M, and additionally, generate an edge of U to M, the generated edges compose of the "small star" transformation output graph.

Convergence critieria:

Convergence means large star and small star transformation generates identical output graph, and we can prove that, the output graph has the same component connectivity, and the topology of the graph is the overall graph is a union of disjoint stars, one for each connected component, and each star has a center node with the minimal label in its connected component.

To check if the graph reaches convergence, we can check the sum of all nodes' "minimal label value in set {*neighbor_nodes, self_node}", the sum keeps decreasing for each pass of large-star / small-star transformation, once it stops decreasing, it means the graph reaches convergence, and we can get each node's connectivity component ID by calculating its "minimal label value in set {*neighbor_nodes, self_node}".

So, current graphframe connected component algorithm code has one error in convergence checking, I correct it in this PR.