Graph Algorithms

This section contains tutorials for graph algorithms implemented in PARAGON. These algorithms are designed for high performance parallel execution and leverage thread-level parallelism to efficiently process large graphs.

The following algorithms are covered in this section:

Graph Algorithms:

• Parallel Breadth First Search (BFS)
• Parallel Depth First Search (DFS)
• Parallel PageRank
• Parallel Connected Components
• Parallel Single Source Shortest Path (SSSP)
• Parallel Triangle Counting

See also

• Get Started with PARAGON

• Graph API Interface

• WeightedGraph API Interface