Neo4j, Data Science, Graph Algorithms, Community Detection, Centrality.
post. In this example, we will project nodes that have a label Country and relationships with a type SIMILAR. CALL gds.graph.create('similarity_network','Country','SIMILAR'); Weakly connected components More often than not, we start the graph analysis with the weakly connected components algorithm.