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.

Every relTypes argument (a name, a comma-separated list or a list of names; null or blank for all types) must name existing edge types. A name that is not an edge type of the schema, such as a typo or a weight property passed where the relationship types go, is rejected with an error instead of being answered as a graph without edges. The weighted procedures all take the relationship types before the weight property.

An optional trailing argument can be left out or passed as null: both take the default the parameter tables list. A value of the wrong type is rejected with an error naming the parameter, for example algo.leiden(): maxIterations must be a number, got String, rather than replaced by the default.

Since v26.10.2. Earlier versions treated an explicit null differently from a left-out argument: some procedures failed with a NullPointerException, and algo.dijkstra.singleSource walked both directions instead of its default OUT. Some numeric arguments of the wrong type were silently replaced by the default.

Algorithm Index

Algorithm Procedure / Function Category Complexity

A*

algo.astar

Path Finding

CPU

Adamic-Adar Index

algo.adamicAdar

Link Prediction

CPU

All-Pairs Shortest Paths (APSP)

algo.apsp

Path Finding

CPU+RAM

All Simple Paths

algo.allsimplepaths

Path Finding

CPU

ArticleRank

algo.articlerank

Centrality

CPU

Articulation Points

algo.articulationPoints

Structural Analysis

CPU

Assortativity

algo.assortativity

Network Science

CPU

Bellman-Ford

algo.bellmanford

Path Finding

CPU

Bellman-Ford (SQL)

bellmanFord()

Path Finding

CPU

Betweenness Centrality

algo.betweenness

Centrality

CPU

BFS (Breadth-First Search)

algo.bfs

Path Finding

CPU

Biconnected Components

algo.biconnectedComponents

Structural Analysis

CPU

Bipartite Check

algo.bipartite

Structural Analysis

CPU

Bipartite Matching

algo.bipartiteMatching

Structural Analysis

CPU

Bridges

algo.bridges

Structural Analysis

CPU

Clique Enumeration

algo.clique

Structural Analysis

CPU

Closeness Centrality

algo.closeness

Centrality

CPU

Common Neighbors

algo.commonNeighbors

Link Prediction

CPU

Conductance

algo.conductance

Community Quality

CPU

Cycle Detection

algo.cycleDetection

Structural Analysis

CPU

Degree Centrality

algo.degree

Centrality

CPU

Densest Subgraph

algo.densestSubgraph

Structural Analysis

CPU

DFS (Depth-First Search)

algo.dfs

Path Finding

CPU

Dijkstra

algo.dijkstra

Path Finding

CPU

Dijkstra Single-Source

algo.dijkstra.singleSource

Path Finding

CPU

Dijkstra (SQL)

dijkstra()

Path Finding

CPU

Eccentricity

algo.eccentricity

Centrality

CPU

Eigenvector Centrality

algo.eigenvector

Centrality

CPU

Graph Coloring

algo.graphColoring

Structural Analysis

CPU

Graph Summary

algo.graphSummary

Graph Statistics

CPU

Harmonic Centrality

algo.harmonic

Centrality

CPU

Hierarchical Clustering

algo.hierarchicalClustering

Community Detection

CPU+RAM

HITS (Hubs and Authorities)

algo.hits

Centrality

CPU

Influence Maximization

algo.influenceMaximization

Network Science

CPU

FastRP (Fast Random Projection)

algo.fastrp

Node Embedding

CPU

GraphSAGE

algo.graphsage

Node Embedding

CPU

HashGNN

algo.hashgnn

Node Embedding

CPU

Jaccard Similarity

algo.jaccard

Similarity

CPU

K-Core Decomposition

algo.kcore

Structural Analysis

CPU

K-Nearest Neighbours (KNN)

algo.knn

Similarity

CPU

K-Shortest Paths

algo.kShortestPaths

Path Finding

CPU+RAM

K-Truss Decomposition

algo.kTruss

Structural Analysis

CPU

Katz Centrality

algo.katz

Centrality

CPU

Label Propagation

algo.labelpropagation

Community Detection

CPU

Leiden

algo.leiden

Community Detection

CPU

Local Clustering Coefficient

algo.localClusteringCoefficient

Structural Analysis

CPU

Longest Path (DAG)

algo.longestPath

Path Finding

CPU

Louvain

algo.louvain

Community Detection

CPU

Max k-Cut (Approximate)

algo.maxKCut

Community Detection

CPU

Maximum Flow

algo.maxFlow

Network Flow

CPU+RAM

Minimum Spanning Arborescence

algo.msa

Path Finding

CPU

Minimum Spanning Tree (MST)

algo.mst

Structural Analysis

CPU

Modularity Score

algo.modularityScore

Community Quality

CPU

Node2Vec

algo.node2vec

Node Embedding

CPU

PageRank

algo.pagerank

Centrality

CPU

Personalized PageRank

algo.personalizedPageRank

Centrality

CPU

Preferential Attachment

algo.preferentialAttachment

Link Prediction

CPU

Random Walk

algo.randomWalk

Traversal / Sampling

CPU

Resource Allocation

algo.resourceAllocation

Link Prediction

CPU

Rich-Club Coefficient

algo.richClub

Network Science

CPU

Same Community

algo.sameCommunity

Link Prediction

CPU

Shortest Path (SQL)

shortestPath()

Path Finding

CPU

SimRank

algo.simRank

Similarity

CPU+RAM

SLPA (Speaker-Listener Label Propagation)

algo.slpa

Community Detection

CPU

Strongly Connected Components (SCC)

algo.scc

Community Detection

CPU

Steiner Tree

algo.steinerTree

Path Finding

CPU+RAM

Topological Sort

algo.topologicalSort

Traversal / Ordering

CPU

Total Neighbors

algo.totalNeighbors

Link Prediction

CPU

Triangle Count

algo.triangleCount

Structural Analysis

CPU

VoteRank

algo.voteRank

Centrality

CPU

Weakly Connected Components (WCC)

algo.wcc

Community Detection

CPU

Categories

Detailed reference is split per category. Pick a category from the left navigation, or jump in: