Graph Algorithms
ArcadeDB provides a comprehensive library of graph algorithms available as Cypher procedures and SQL functions. Cypher procedures follow the pattern:
CALL algo.name([arg1, arg2, ...]) YIELD field1, field2, ...
RETURN field1, field2, ...
SQL path functions return a list of vertex RIDs and can be used directly in SELECT statements.
Algorithm Index
| Algorithm | Procedure / Function | Category | Complexity |
|---|---|---|---|
|
Path Finding |
CPU |
|
|
Link Prediction |
CPU |
|
|
Path Finding |
CPU+RAM |
|
|
Path Finding |
CPU |
|
|
Centrality |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Network Science |
CPU |
|
|
Path Finding |
CPU |
|
|
Path Finding |
CPU |
|
|
Centrality |
CPU |
|
|
Path Finding |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Centrality |
CPU |
|
|
Link Prediction |
CPU |
|
|
Community Quality |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Centrality |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Path Finding |
CPU |
|
|
Path Finding |
CPU |
|
|
Path Finding |
CPU |
|
|
Path Finding |
CPU |
|
|
Centrality |
CPU |
|
|
Centrality |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Graph Statistics |
CPU |
|
|
Centrality |
CPU |
|
|
Community Detection |
CPU+RAM |
|
|
Centrality |
CPU |
|
|
Network Science |
CPU |
|
|
Node Embedding |
CPU |
|
|
Node Embedding |
CPU |
|
|
Node Embedding |
CPU |
|
|
Similarity |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Similarity |
CPU |
|
|
Path Finding |
CPU+RAM |
|
|
Structural Analysis |
CPU |
|
|
Centrality |
CPU |
|
|
Community Detection |
CPU |
|
|
Community Detection |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Path Finding |
CPU |
|
|
Community Detection |
CPU |
|
|
Community Detection |
CPU |
|
|
Network Flow |
CPU+RAM |
|
|
Path Finding |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Community Quality |
CPU |
|
|
Node Embedding |
CPU |
|
|
Centrality |
CPU |
|
|
Centrality |
CPU |
|
|
Link Prediction |
CPU |
|
|
Traversal / Sampling |
CPU |
|
|
Link Prediction |
CPU |
|
|
Network Science |
CPU |
|
|
Link Prediction |
CPU |
|
|
Path Finding |
CPU |
|
|
Similarity |
CPU+RAM |
|
|
Community Detection |
CPU |
|
|
Community Detection |
CPU |
|
|
Path Finding |
CPU+RAM |
|
|
Traversal / Ordering |
CPU |
|
|
Link Prediction |
CPU |
|
|
Structural Analysis |
CPU |
|
|
Centrality |
CPU |
|
|
Community Detection |
CPU |
Categories
Detailed reference is split per category. Pick a category from the left navigation, or jump in:
-
Path Finding — Dijkstra, A*, Bellman-Ford, BFS, DFS, K-Shortest Paths, and more
-
Centrality — PageRank, Betweenness, Closeness, Eigenvector, HITS, Katz, and more
-
Community Detection — Louvain, Leiden, Label Propagation, SCC, WCC, and more
-
Structural Analysis — Articulation Points, Bridges, Cliques, K-Core, K-Truss, and more
-
Similarity & Link Prediction — Jaccard, Adamic-Adar, SimRank, Preferential Attachment
-
Network Flow — Maximum Flow
-
Traversal & Sampling — Random Walk, Topological Sort
-
Network Science — Assortativity, Rich-Club, Influence Maximization
-
Community Quality — Conductance, Modularity Score
-
Graph Statistics — Graph Summary
-
Node Embedding — Node2Vec, FastRP, GraphSAGE, HashGNN
-
SQL Path Functions —
dijkstra(),bellmanFord(),shortestPath()as SQL functions -
Notes — shared parameter conventions and memory considerations