PARAGON

Contents:

  • Installation Guide
    • Requirements
      • Python
    • Installation via pip (Recommended)
    • Platform-Specific Setup
      • Linux (Ubuntu / Debian)
      • macOS
      • Windows
    • Verify Installation
    • Quick Start
    • Stable Release
    • Troubleshooting
  • Get Started with PARAGON
    • Links to Other Helpful Resources
    • Basic Usage
      • Creating a Graph
      • Working with Weighted Graphs
      • Running a Parallel Algorithm
    • Next Steps
  • PARAGON Tutorials
    • Introduction to Graphs
      • Graph Definition
      • Vertices and Edges
      • Types of Graphs
        • Undirected Graph
        • Directed Graph (Digraph)
      • Weighted Graph
        • Example (Weighted Edge Set)
        • Use Cases of Weighted Graphs
      • Graph Properties
        • Degree
        • Path
        • Cycle
        • Connectivity
      • Graph Density
      • Graph Representations
        • Adjacency List
        • Adjacency Matrix
      • Summary
    • Graph API Interface
      • Overview
      • Initialization
        • 1. Initialize with number of vertices
        • 2. Initialize with edges
        • 3. Directed graph
      • Edge Operations
        • add_edge(u, v)
        • add_edges(edges)
        • add_vertex()
      • Graph Construction
        • build_from_adj_matrix(matrix)
        • build_from_adj_list(adjacency)
      • Graph Information
        • vertices()
        • is_directed()
        • get_adj()
        • degree(u)
        • has_edge(u, v)
      • Debug Utilities
        • print_graph()
      • Representation & Dunder Methods
        • __repr__()
        • __len__()
        • __contains__(node)
        • __getitem__(node)
        • __iter__()
        • __eq__(other)
        • __ne__(other)
        • __bool__()
        • __copy__() and __deepcopy__()
      • Complete Dunder Methods Example
      • Complete Example
      • Best Practices
    • WeightedGraph API Interface
      • Overview
      • Initialization
        • 1. Initialize weighted graph
        • 2. Directed weighted graph
      • Edge Operations
        • add_edge(u, v, w)
        • add_edges(edges)
        • add_vertex()
      • Graph Construction
        • build_from_adj_list(adjacency)
        • build_from_adj_matrix(matrix)
      • Graph Information
        • vertices()
        • is_directed()
        • get_adj()
        • degree(u)
        • has_edge(u, v)
      • Debug Utilities
        • print_graph()
      • Representation & Dunder Methods
        • __repr__()
        • __len__()
        • __contains__()
        • __getitem__()
        • __iter__()
        • __eq__ / __ne__()
        • __copy__ / __deepcopy__()
      • Complete Dunder Methods Example
      • Complete Example
      • Best Practices
    • Graph Algorithms
      • Parallel Breadth First Search (BFS)
        • Overview
        • Function Signature
        • Parameters
        • Return Value
        • Basic Example
        • Advanced Example
        • Algorithm Details
        • Time Complexity
        • Best Practices
      • Parallel Depth First Search (DFS)
        • Overview
        • Function Signature
        • Parameters
        • Return Value
        • Basic Example
        • Advanced Example
        • Algorithm Details
        • Time Complexity
        • Best Practices
      • Parallel PageRank
        • Overview
        • PageRank Formula
        • Available Functions
        • Parameters
        • Return Value
        • Pull-Based PageRank
        • Push-Based PageRank (BFS-style)
        • Advanced Example
        • Algorithm Details
        • Comparison
        • Time Complexity
        • Best Practices
      • Parallel Connected Components
        • Overview
        • Function Signature
        • Parameters
        • Return Value
        • Basic Example
        • Advanced Example
        • Algorithm Details
        • Time Complexity
        • Best Practices
      • Parallel Single Source Shortest Path (SSSP)
        • Overview
        • Function Signature
        • Parameters
        • Return Value
        • Basic Example
        • Advanced Example
        • Algorithm Details
        • Time Complexity
        • Best Practices
      • Parallel Triangle Counting
        • Overview
        • Function Signature
        • Parameters
        • Return Value
        • Basic Example
        • Advanced Example
        • Algorithm Details
        • Time Complexity
        • Best Practices
  • Python Package
    • Python API Reference
      • Core Data Structures
        • Graph
        • WeightedGraph
        • Graph
        • WeightedGraph
      • Graph Generators
        • generate_normal_graph()
        • generate_normal_weighted_graph()
        • generate_normal_graph()
        • generate_normal_weighted_graph()
      • Graph Algorithms
        • parallel_bfs()
        • parallel_connected_components()
        • parallel_dfs()
        • parallel_dijkstra()
        • parallel_pagerank()
        • parallel_pagerank_bfs()
        • parallel_triangle_count()
        • Traversal Algorithms
        • Connectivity Algorithms
        • Shortest Path Algorithms
        • Ranking Algorithms
        • Subgraph Algorithms
      • Utilities
    • Supported Python Data Structures
      • Markers
      • Table Header
      • Support Matrix
  • Benchmarks
    • Analysis
      • SSSP (Parallel Relaxation)
      • PageRank
      • Connected Components
      • Triangle Counting
    • Key Takeaways
    • Example Benchmark Code
PARAGON
  • Overview: module code

All modules for which code is available

  • paragon.algorithms.pagerank
  • paragon.algorithms.parallel_bfs
  • paragon.algorithms.parallel_connected_components
  • paragon.algorithms.parallel_dfs
  • paragon.algorithms.sssp
  • paragon.algorithms.triangle_count
  • paragon.core
  • paragon.graphs

© Copyright 2026, Jha Saket Sunil.

Built with Sphinx using a theme provided by Read the Docs.