A connected components algorithm example.
The connected components algorithm labels each connected component of the graph
with the ID of its lowest-numbered vertex.
For example, in a social network, connected components can approximate clusters.
GraphX contains an implementation of the algorithm in the
[ConnectedComponents object][ConnectedComponents],
and we compute the connected components of the example social network dataset.
A connected components algorithm example. The connected components algorithm labels each connected component of the graph with the ID of its lowest-numbered vertex. For example, in a social network, connected components can approximate clusters. GraphX contains an implementation of the algorithm in the [
ConnectedComponents
object][ConnectedComponents], and we compute the connected components of the example social network dataset.Run with