PGX 20.1.1
Documentation

Graph Algorithms

PGX provides built-in implementations for a rich set of popular graph algorithms, including:

  • Centrality - Degree Centrality, Eigenvector Centrality, PageRank, Betweenness Centrality, Closedness Centrality, HITS, ...
  • Component and Community - Strongly Connected Components (Tarjan's and Kosaraju's). Weakly Connected Components,
  • Twitter's Who-To-Follow, Label Propagation, ...
  • Path Finding - Single source all destination (Bellman-Ford), Dijsktra's shortest path, Hop Distance (Breadth-first search), ...
  • Community Evaluation - Coefficient (Triangle Counting), Conductance, Modularity, Adamic-Adar counter ...

Morover, PGX provides domain-specific languages (DSLs) to write custom graph algorithms. Refer to the analytics section and, in particular to the PGX Algorithm reference for more information.