A scatter-gather implementation of the Weakly Connected Components algorithm.
This implementation uses a comparable vertex value as initial component
identifier (ID). Vertices propagate their current value in each iteration.
Upon receiving component IDs from its neighbors, a vertex adopts a new
component ID if its value is lower than its current component ID.
The algorithm converges when vertices no longer update their component ID
value or when the maximum number of iterations has been reached.
The result is a DataSet of vertices, where the vertex value corresponds to
the assigned component ID.
Creates an instance of the Connected Components algorithm.
The algorithm computes weakly connected components
and converges when no vertex updates its component ID
or when the maximum number of iterations has been reached.
maxIterations - The maximum number of iterations to run.