List of Supported and Planned Algorithms#
Supported Graph#
Type | Description |
---|---|
Graph | A directed or undirected Graph (use directed={True, False}) |
Multigraph | A Graph with multiple edges between a vertex pair |
ALL Algorithms support Graphs and MultiGraph (directed and undirected)
Supported Algorithms#
Italic algorithms are planned for future releases.
Note: Multi-GPU, or MG, includes support for Multi-Node Multi-GPU (also called MNMG).
Category | Algorithm | Scale | Notes |
---|---|---|---|
Centrality | |||
Katz | Multi-GPU | ||
Betweenness Centrality | Single-GPU | MG planned for 23.02 | |
Edge Betweenness Centrality | Single-GPU | MG planned for 23.02 | |
Eigenvector Centrality | Multi-GPU | ||
Degree Centrality | Multi-GPU | Python only | |
Community | |||
Leiden | Single-GPU | MG planned for 23.02 | |
Louvain | Multi-GPU | ||
Ensemble Clustering for Graphs | Single-GPU | ||
Spectral-Clustering - Balanced Cut | Single-GPU | ||
Spectral-Clustering - Modularity | Single-GPU | ||
Subgraph Extraction | Single-GPU | ||
Triangle Counting | Multi-GPU | ||
K-Truss | Single-GPU | ||
Components | |||
Weakly Connected Components | Multi-GPU | ||
Strongly Connected Components | Single-GPU | ||
Core | |||
K-Core | Multi-GPU | ||
Core Number | Multi-GPU | ||
Flow | |||
MaxFlow | --- | ||
Influence | |||
Influence Maximization | --- | ||
Layout | |||
Force Atlas 2 | Single-GPU | ||
Linear Assignment | |||
Hungarian | Single-GPU | README | |
Link Analysis | |||
Pagerank | Multi-GPU | C++ README | |
Personal Pagerank | Multi-GPU | C++ README | |
HITS | Multi-GPU | ||
Link Prediction | |||
Jaccard Similarity | Multi-GPU | MG as of 22.12 Directed graph only |
|
Weighted Jaccard Similarity | Single-GPU | ||
Overlap Similarity | Multi-GPU | MG as of 22.12 | |
Sorensen Coefficient | Multi-GPU | MG as of 22.12 | |
Local Clustering Coefficient | --- | ||
Sampling | |||
Uniform Random Walks (RW) | Multi-GPU | ||
Biased Random Walks (RW) | --- | ||
Egonet | Multi-GPU | ||
Node2Vec | Single-GPU | MG planned for 23.02 | |
Uniform Neighborhood sampling | Multi-GPU | ||
Traversal | |||
Breadth First Search (BFS) | Multi-GPU | with cutoff support``C++ README | |
Single Source Shortest Path (SSSP) | Multi-GPU | C++ README | |
ASSP / APSP | --- | ||
Tree | |||
Minimum Spanning Tree | Single-GPU | ||
Maximum Spanning Tree | Single-GPU | ||
Other | |||
Renumbering | Multi-GPU | multiple columns, any data type | |
Symmetrize | Multi-GPU | ||
Path Extraction | Extract paths from BFS/SSP results in parallel | ||
Two Hop Neighbors | Multi-GPU | ||
Data Generator | |||
RMAT | Multi-GPU | ||
Barabasi-Albert | --- | ||