cuGraph Python API

The cuGraph Python API provides graph construction, single-GPU algorithms, and multi-GPU algorithms through cugraph.dask.

API Documentation

• Graph Classes
  • Constructors
  • Adding Data
  • Checks
  • Symmetrize
  • Conversion from Other Formats
  • NumberMap
  • Other
• Graph Implementation
  • cugraph.structure.graph_implementation.simpleGraphImpl.view_edge_list
  • cugraph.structure.graph_implementation.simpleGraphImpl.delete_edge_list
  • cugraph.structure.graph_implementation.simpleGraphImpl.view_adj_list
  • cugraph.structure.graph_implementation.simpleGraphImpl.view_transposed_adj_list
  • cugraph.structure.graph_implementation.simpleGraphImpl.delete_adj_list
  • cugraph.structure.graph_implementation.simpleGraphImpl.enable_batch
  • cugraph.structure.graph_implementation.simpleGraphImpl.get_two_hop_neighbors
  • cugraph.structure.graph_implementation.simpleGraphImpl.number_of_vertices
  • cugraph.structure.graph_implementation.simpleGraphImpl.number_of_nodes
  • cugraph.structure.graph_implementation.simpleGraphImpl.number_of_edges
  • cugraph.structure.graph_implementation.simpleGraphImpl.in_degree
  • cugraph.structure.graph_implementation.simpleGraphImpl.out_degree
  • cugraph.structure.graph_implementation.simpleGraphImpl.degree
  • cugraph.structure.graph_implementation.simpleGraphImpl.degrees
  • cugraph.structure.graph_implementation.simpleGraphImpl.has_edge
  • cugraph.structure.graph_implementation.simpleGraphImpl.has_node
  • cugraph.structure.graph_implementation.simpleGraphImpl.has_self_loop
  • cugraph.structure.graph_implementation.simpleGraphImpl.edges
  • cugraph.structure.graph_implementation.simpleGraphImpl.nodes
  • cugraph.structure.graph_implementation.simpleGraphImpl.neighbors
  • cugraph.structure.graph_implementation.simpleGraphImpl.vertex_column_size
• Centrality
  • Betweenness Centrality
  • Katz Centrality
  • Degree Centrality
  • Eigenvector Centrality
• Community
  • EgoNet
  • Ensemble clustering for graphs (ECG)
  • K-Truss
  • Leiden
  • Louvain
  • Spectral Clustering
  • Induced Subgraph
  • Triangle Counting
• Components
  • Connected Components
• Cores
  • Core Number
  • K-Core
• Layout
  • Force Atlas 2
• Linear Assignment
  • Hungarian
• Link Analysis
  • HITS
  • Pagerank
• Link Prediction
  • Cosine
  • Jaccard Coefficient
  • Overlap Coefficient
  • Sorensen Coefficient
• Sampling
  • Random walks
  • Neighbor sampling
• Traversal
  • Breadth-first-search
  • Breadth-first-search (MG)
  • Single-source-shortest-path
  • Single-source-shortest-path (MG)
• Tree
  • Minimum Spanning Tree
  • Maximum Spanning Tree
• Generators
  • RMAT
• DASK MG Helper functions
  • Methods
• Multi-GPU with cuGraph
  • Distributed graph analytics
  • Example