16.6 Executing Built-in Algorithms
The graph server (PGX) contains a set of built-in algorithms that are available as Java APIs.
The following table provides an overview of the available algorithms, grouped by category. Note that these algorithms can be invoked through the Analyst Class.
Note:
See the supported Built-In Algorithms on GitHub for more details.Table 16-11 Overview of Built-In Algorithms
| Category | Algorithms |
|---|---|
| Classic graph algorithms | Prim's Algorithm, Prim's Algorithm (Ignoring edge directions) |
| Community detection | Conductance Minimization (Soman and Narang Algorithm), Infomap, Label Propagation, Louvain, LouvainDirected, Speaker Listener Label Propagation |
| Connected components | Strongly Connected Components, Weakly Connected Components (WCC) |
| Link predition | WTF (Whom To Follow) Algorithm |
| Matrix factorization | Matrix Factorization |
| Other | Graph Traversal Algorithms |
| Path finding | All Vertices and Edges on Filtered Path, Bellman-Ford Algorithms, Bidirectional Dijkstra Algorithms, Compute Distance Index, Compute High-Degree Vertices, Dijkstra Algorithms, Enumerate Simple Paths, Fast Path Finding, Fattest Path, Fattest Path (ignoring edge directions), Filtered Fast Path Finding, Hop Distance Algorithms |
| Ranking and walking | ArticleRank Algorithms, Closeness Centrality Algorithms, Degree Centrality Algorithms, Eigenvector Centrality, Harmonic Centrality, Hyperlink-Induced Topic Search (HITS), PageRank Algorithms, Random Walk with Restart, Stochastic Approach for Link-Structure Analysis (SALSA) Algorithms, Vertex Betweenness Centrality Algorithms |
| Structure evaluation | Adamic-Adar algorithms, Bipartite Check, Clustering Coefficient Algorithms, Conductance, Cycle Detection Algorithms, Degree Distribution Algorithms, Eccentricity Algorithms, K-Core, Modularity, Partition Conductance, Reachability Algorithms, Topological Ordering Algorithms, Triangle Counting Algorithms |
This following topics describe the use of the graph server (PGX) using Triangle Counting and PageRank analytics as examples.
- About Built-In Algorithms in the Graph Server (PGX)
The graph server (PGX) contains a set of built-in algorithms that are available as Java and Python APIs. - Getting the Progress of a Running Algorithm
The progress of a graph algorithm is based on the value of a monotonically increasing counter that gets incremented periodically during algorithm executions. - Centrality Algorithms
Centrality algorithms are used to assess the importance or influence of nodes within a graph. - Running the Triangle Counting Algorithm
Parent topic: Developing Applications with Graph Analytics