weakly connected components
Groups of nodes in which every node is reachable from every other, once relationship direction is ignored. The GDS algorithm that finds them takes the same name.
Also written: WCC
Example
Five people in two groups, with no relationship running between the groups.
cypher
CALL gds.wcc.stream('people')
YIELD nodeId, componentId
RETURN gds.util.asNode(nodeId).name AS person, componentIdAva, Ben and Cleo come back with one componentId. Dan and Eve come back with another. No relationship joins the two groups, so nothing puts all five in one component.
Lessons that use this term
The lesson and course links below open in a new tab.
No published lesson uses this term yet.