Description
Runing ConnectedComponents is time-consuming on big and complex graph.
I use it on a graph with 1.7B vertices and 11B edges, and the exact result is not a must. So I think user can directly control the maxIteration of this algorithm.
Runing ConnectedComponents is time-consuming on big and complex graph.
I use it on a graph with 1.7B vertices and 11B edges, and the exact result is not a must. So I think user can directly control the maxIteration of this algorithm.