In strongly connected components, the direction of relationships matters. Each node in a component must be able to join any other node in the same component in both directions. Focusing on the nodes A to G, which were grouped in the same community by the weakly connected component algorithm, you can see that it is not always possible to go from one node to another in both directions. For instance, going from D to A is possible (through C), but going from A to D is impossible.
To see the components identified with this stronger rule, we can use the gds.alpha.scc procedure in the following way:
CALL gds.alpha.scc.stream("simple_projected_graph")
YIELD nodeId, partition as componentId
RETURN gds.util.asNode(nodeId).name as nodeName, componentId
ORDER BY componentId
Here are the results of the preceding code:
╒══════════╤══════...
