Algorithms overview

The following algorithms are grouped by the problem they solve.

Before running an algorithm for the first time, follow Prepare algorithm sample data to check the directory mount. Each algorithm page provides CSV downloads, import statements, and instructions for viewing results.

Category	Algorithm
Centrality	PageRank
Centrality	Personalized PageRank (PPR)
Centrality	Degree Centrality
Centrality	Closeness Centrality
Centrality	Betweenness Centrality
Centrality	HITS
Path finding	Single-Source Shortest Paths (SSSP)
Path finding	Breadth-First Search (BFS)
Path finding	Cycle Detection
Path finding	All-Pairs Shortest Path
Path finding	A* Shortest Path
Path finding	Depth-First Search
Path finding	Dijkstra Shortest Path
Path finding	K-Hop Traversal
Path finding	Maximum Flow
Path finding	Minimum Spanning Tree
Path finding	Random Walk
Path finding	Single-Pair Shortest Path
Community detection	Weakly Connected Components (WCC)
Community detection	Label Propagation Algorithm (LPA)
Community detection	Louvain Community Detection
Community detection	Clustering Coefficient
Community detection	HANP
Community detection	Infomap
Community detection	K-Core
Community detection	K-Means
Community detection	Strongly Connected Components
Community detection	Triangle Count
Similarity	Jaccard Similarity
Similarity	Cosine Similarity
Node embedding	FastRP
Node embedding	GraphSAGE
Topological link prediction	Adamic-Adar
Topological link prediction	Common Neighbors