Module parallel_algorithms 

Parallel graph algorithms for large-scale graph analytics

This module provides parallel implementations of fundamental graph algorithms, designed for performance on multi-core systems. All algorithms operate on the CsrGraph format for cache-friendly, contiguous memory access.

Algorithms

• Parallel BFS: Level-synchronous breadth-first search
• Parallel Connected Components: Union-find with path compression
• Parallel PageRank: Power iteration with parallel SpMV
• Parallel Triangle Counting: Intersection-based counting

All algorithms are feature-gated behind #[cfg(feature = "parallel")].

Structs

BfsResult

Result of a BFS traversal.

ComponentsResult

Result of connected components computation.

PageRankConfig

Configuration for PageRank computation.

PageRankResult

Result of PageRank computation.

TriangleCountResult

Result of triangle counting.

Functions

bfs

Sequential BFS for comparison and non-parallel builds.

connected_components

Sequential connected components (for non-parallel builds).

pagerank

Sequential PageRank for non-parallel builds.

parallel_bfs

Perform a level-synchronous parallel BFS from a source node.

parallel_connected_components

Find connected components using parallel label propagation with union-find.

parallel_pagerank

Compute PageRank using parallel power iteration.

parallel_triangle_count

Count triangles in an undirected graph using parallel intersection.

triangle_count

Sequential triangle counting.