The first algorithm we are going to study here is weakly connected components or union-find.
Weakly connected components, together with the Louvain and Label Propagation algorithms we are going to cover later on in this chapter, are production-ready algorithms in the GDS as of version 1.0.
To see the results of graph partitioning using weakly connected components, use the following query:
CALL gds.wcc.stream("simple_projected_graph")
YIELD nodeId, componentId
RETURN gds.util.asNode(nodeId).name as nodeName, componentId
ORDER BY componentId
Here are our results:
╒══════════╤═════════════╕
│"nodeName"│"componentId"│
╞══════════╪═══...
