Neo4j GDS Algorithms for GraphRAG
Key Graph Data Science algorithms useful for GraphRAG.
Neo4j Documentation2024
Key algorithms: Community Detection (Leiden, Louvain, Label Propagation), Centrality (PageRank, Betweenness, Degree), Similarity (Node Similarity, K-Nearest Neighbors), Path Finding (Shortest Path, All Shortest Paths, Dijkstra). Usage pattern: Project graph, run algorithm, write results back to nodes, query in retrieval pipeline.
Tags
gdsalgorithmscentralitycommunity-detectionneo4j