
121
relationships
Key Graph Algorithms (With neo4j)
An essential part of graph databases is the fact that they have
different
descriptive statistics. Here
are these unique descriptive statistics.
• Centrality - What are the most critical nodes in the network? PageRank, Betweenness Central-
ity, Closeness Centrality
• Community detection - How can the graph be partitioned? Union Find, Louvain, Label
Propagation, Connected Components
• Pathfinding - What are the shortest paths or best routes available given the cost? Minimum
Weight Spanning Tree, All Pairs- and Single Source- Shortest Path, Dijkstra
Let’s take a look at the Cypher code to do this operation. ...