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 | Notebooks | Scale | Notes |
|---|---|---|---|
| Centrality | Centrality | ||
| Katz | Multi-GPU | ||
| Betweenness Centrality | Multi-GPU | MG as of 23.06 | |
| Edge Betweenness Centrality | Multi-GPU | MG as of 23.08 | |
| Eigenvector Centrality | Multi-GPU | ||
| Degree Centrality | Multi-GPU | Python only | |
| Community | |||
| Leiden | Multi-GPU | MG as of 23.06 | |
| Louvain | Multi-GPU | ||
| Ensemble Clustering for Graphs | Single-GPU | MG planned for 24.02 | |
| Spectral-Clustering - Balanced Cut | Single-GPU | ||
| Spectral-Clustering - Modularity | Single-GPU | ||
| Subgraph Extraction | Single-GPU | ||
| Triangle Counting | Multi-GPU | ||
| K-Truss | Single-GPU | MG planned for 2024 | |
| 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 | Directed graph only | |
| Weighted Jaccard Similarity | Single-GPU | ||
| Overlap Similarity | Multi-GPU | ||
| Sorensen Coefficient | Multi-GPU | MG is unweighted only | |
| Local Clustering Coefficient | --- | ||
| Sampling | |||
| Uniform Random Walks RW | Multi-GPU | ||
| Biased Random Walks (RW) | --- | ||
| Egonet | Multi-GPU | ||
| Node2Vec | Multi-GPU | ||
| 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 | --- | ||
Copyright (c) 2019 - 2023, NVIDIA CORPORATION.
Licensed under the Apache License, Version 2.0 (the “License”); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an “AS IS” BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.