Edgewise
Oct 2026 – presentA C++20 library of parallel graph algorithms (BFS, PageRank, connected components) built on persistent worker threads and a CAS-based union-find. Up to 4.4× faster than sequential on million-vertex graphs.
Highlights
- Parallel connected components ran 3.40× and 2.06× faster than sequential union-find on SNAP road and YouTube graphs (1.1M–2.0M vertices).
- Parallel BFS and PageRank ran 4.1× and 4.4× faster on generated 1.5M-vertex graphs.
- Persistent worker threads, barrier synchronization and a CAS-based concurrent union-find on shared CSR storage.
- GoogleTest suite runs under ThreadSanitizer in GitHub Actions CI.
