Graph Algorithms and Data Structures in C++20
summary
Claims that graph algorithms can be expressed generically in C++20 by mapping graph type requirements onto existing range-of-ranges concepts and using Concepts; provides a concrete CSR graph container (static, compressed sparse row, no vertex/edge insertion after build), an RR adapter, and a proposed CSR_partite variant for partitioned labels; exposes view-based DFS/BFS/shortest-path prototypes, uses tag_invoke/nibloid customization points, publishes code on GitHub, and targets proposal submission toward C++26 (Feb 2025) while leaving parallel algorithms for later.
AI-written summary · about
chapters (6)
- 0:00C++20 graph library intro
- 12:18Defining graphs in C++
- 23:55Graph algorithms requirements
- 30:55CSR graph container
- 46:01Timeline and future plans
- 49:53Q&A
