Skip to content

Latest commit

 

History

History
55 lines (44 loc) · 3.41 KB

File metadata and controls

55 lines (44 loc) · 3.41 KB
graph-v3 logo

graph-v3 Documentation

A modern C++20 graph library — 13 algorithms, 7 lazy views, 2 adaptors, 3 containers, 4 generators, 3 I/O formats, bidirectional edge access, 4874+ 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
  • Containersdynamic_graph, compressed_graph, undirected_adjacency_list, 27 trait combinations
  • Views — lazy traversal views (breadth-first search, depth-first search, topological sort, etc.)
  • Adaptors — non-owning graph wrappers (filtered_graph, BGL adaptor)
  • BGL Adaptor — use graph-v3 on Boost.Graph data structures
  • Bidirectional Access — incoming edges, reverse traversal, in_edge_accessor
  • Algorithms — Dijkstra and Bellman-Ford shortest-paths, minimal spanning tree, connected components, and more
  • Graph I/O — read and write DOT (GraphViz), GraphML (XML), and JSON formats
  • Generators — synthetic graph generators (path, grid, Erdős–Rényi, Barabási–Albert)
  • Examples — complete working programs (third-party adaptation, CppCon 2021/2022 demos, Dijkstra, MST, BGL adaptor)

Reference

For Contributors

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