C++ Standardization

graph-v3 is the reference implementation for a proposed graph library for the ISO C++ Standard (C++29/C++32).

---

graph-v3 is developed under the WG21 umbrella and targets the Standard Library Evolution Working Group (LEWG).

The previous reference implementation is graph-v2. graph-v3 refines and supersedes that work.

Goals

The proposed library aims to:

Support creation of high-performance, state-of-the-art graph algorithms.
Provide syntax that is simple, expressive and easy to understand when writing algorithms.
Define useful concepts and traits that algorithms can use to express their requirements.
Support views for graph traversal commonly used by algorithms.
Support optional, user-defined value types for edges, vertices and the graph itself.
Allow the use of standard containers to define simple graphs.
Enable easy integration of existing graph data structures.

The following papers collectively form the current proposal submitted to WG21.

Paper	Title	Description
P3126	Overview	Describes the big picture of what is being proposed.
P3127	Background and Terminology	Motivation and theoretical background underlying the proposal.
P3128	Algorithms	Covers the initial algorithms as well as planned future additions.
P3129	Views	Helpful views for traversing a graph.
P3130	Graph Container Interface	The core interface for uniformly accessing graph data structures and adapting to external graphs.
P3131	Graph Containers	Includes `compressed_graph` and use of standard containers to define simple graphs.
P3337	Graph Comparison	Syntax and performance comparison to the Boost Graph Library.

Paper	Library location
P3128 Algorithms	`include/graph/algorithm/`
P3129 Views	`include/graph/views/`
P3130 Graph Container Interface	`include/graph/detail/` and CPO Reference
P3131 Graph Containers	`include/graph/container/`

The NWGraph team for collaboration and algorithm implementations.
The Machine Learning study group (SG19) of the ISO C++ Standards Committee (WG21) for comments and support.