index.md

graph-v3 Documentation A modern C++20 graph library — 13 algorithms, 7 lazy views, 3 containers, bidirectional edge access, 4405+ tests.

---

For Users

• Getting Started — installation, first graph, first algorithm
• Adjacency Lists — range-of-ranges model, concepts, CPOs
• Edge Lists — flat sourced-edge model, concepts, patterns
• Containers — dynamic_graph, compressed_graph, undirected_adjacency_list, 27 trait combinations
• Views — lazy traversal views (breadth-first search, depth-first search, topological sort, etc.)
• Bidirectional Access — incoming edges, reverse traversal, in_edge_accessor
• Algorithms — Dijkstra and Bellman-Ford shortest-paths, minimal spanning tree, connected components, and more

Reference

• Adjacency List Interface — GCI spec for adjacency lists
• Edge List Interface — GCI spec for edge lists
• Concepts — all graph concepts in one place
• CPO Reference — CPO signatures and behavior
• Algorithm Complexity — time/space cheat sheet
• Edge Value Concepts — edge value type concepts
• Vertex Patterns — inner value and storage patterns
• Type Aliases — collected type alias reference

For Contributors

• Architecture — design principles, directory structure, range-of-ranges model
• Coding Guidelines — naming, style, conventions
• CPO Implementation Guide — how to add a new CPO
• CPO Order — implementation priority and dependency order
• Algorithm Template — template for new algorithm docs
• View Template — template for new view docs
• View Chaining — how view chaining works (and the solution to its limitations)

Other

• FAQ — common questions and answers
• Status & Metrics — canonical counts and implementation matrix
• Code Coverage — line and function coverage report (95.8% lines, 92.0% functions)
• C++ Standardization — ISO C++ proposal papers (P3126–P3131, P3337) and participation
• Migration from v2 — what changed from graph-v2 and how to migrate