stdgraph · pratzl · Mar 1, 2026 · Feb 27, 2026 · Mar 1, 2026
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -2,6 +2,10 @@
 
 ## [Unreleased]
 
+---
+
+## [0.5.0] - 2026-03-01 *(Initial Beta)*
+
 ### Added
 - **Bidirectional edge access** — `in_edges`, `in_degree`, `find_in_edge`, `contains_in_edge` CPOs
 - `bidirectional_adjacency_list` concept

diff --git a/README.md b/README.md
@@ -1,10 +1,10 @@
 <table><tr>
-<td><img src="docs/assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td><img src="docs/assets/logo_text.svg" width="400" alt="graph-v3 logo"></td>
 <td>
 
 # graph-v3
 
-**A modern C++20 graph library — header-only, descriptor-based, works with your graphs.**
+**A modern C++20 graph library — generic, header-only, works with your graphs**
 
 </td>
 </tr></table>
@@ -20,7 +20,8 @@
 ## Highlights
 
 - **Header-only** — drop into any CMake project; no compiled components
-- **Works with your containers** — `std::vector<std::vector<int>>` or `std::map<int, std::vector<int>>` are valid graphs out of the box
+- **Generic** - Enabled by the use of descriptors.
+- **Works with your graphs** — Bring your own graph. `std::vector<std::vector<int>>` and `std::map<int, std::list<std::pair<int,double>>>` are also valid graphs out of the box.
 - **13 algorithms** — Dijkstra, Bellman-Ford, BFS, DFS, topological sort, connected components, articulation points, biconnected components, MST, triangle counting, MIS, label propagation, Jaccard coefficient
 - **7 lazy views** — vertexlist, edgelist, incidence, neighbors, BFS, DFS, topological sort — all composable with range adaptors
 - **Bidirectional edge access** — `in_edges`, `in_degree`, reverse BFS/DFS/topological sort via `in_edge_accessor`
@@ -108,7 +109,7 @@ Both share a common descriptor system and customization-point interface.
 | Compiler | Version | Platform | Status |
 |----------|---------|----------|--------|
 | GCC      | 13 +    | Linux    | Tested |
-| Clang    | 10 +    | Linux, macOS | Tested |
+| Clang    | 18 +    | Linux, macOS | Tested |
 | MSVC     | 2022 +  | Windows  | Tested |
 
 Requires **CMake 3.20+** and a **C++20**-capable toolchain.
@@ -172,6 +173,7 @@ The full documentation hub is at [docs/index.md](docs/index.md).
 Quick links:
 
 - [Getting Started](docs/index.md#users)
+- [C++ Standardization](docs/standardization.md) — ISO C++ papers and proposal status
 - [Migration from graph-v2](docs/migration-from-v2.md)
 - [FAQ](docs/FAQ.md)
 - [Implementation Matrix](docs/status/implementation_matrix.md)

diff --git a/VERSION b/VERSION
@@ -1 +1 @@
-0.1.0
+0.5.0
diff --git a/docs/FAQ.md b/docs/FAQ.md
@@ -1,5 +1,12 @@
+<table><tr>
+<td><img src="assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Frequently Asked Questions
 
+</td>
+</tr></table>
+
 > [← Back to Documentation Index](index.md)
 
 ---

diff --git a/docs/assets/logo_text.svg b/docs/assets/logo_text.svg
diff --git a/docs/contributing/algorithm-template.md b/docs/contributing/algorithm-template.md
@@ -1,6 +1,14 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Algorithm Documentation Template
 
-This template provides a standardized format for documenting graph algorithms in the graph-v3 library. Follow this structure to ensure consistency and completeness across all algorithm documentation.
+
+> This template provides a standardized format for documenting graph algorithms in the graph-v3 library. Follow this structure to ensure consistency and completeness across all algorithm documentation.
+
+</td>
+</tr></table>
 
 ## Algorithm Name
 

diff --git a/docs/contributing/architecture.md b/docs/contributing/architecture.md
@@ -1,7 +1,13 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Architecture Guide
 
 > How graph-v3 is structured, and the design principles behind it.
 
+</td>
+</tr></table>
 ---
 
 ## Directory Structure

diff --git a/docs/contributing/coding-guidelines.md b/docs/contributing/coding-guidelines.md
@@ -1,6 +1,14 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Coding Guidelines
 
-These requirements apply to every graph-related component, including implementations, views, algorithms, and the data model.
+
+> These requirements apply to every graph-related component, including implementations, views, algorithms, and the data model.
+
+</td>
+</tr></table>
 
 ## Core Architectural Commitments
 1. The interface MUST be able to adapt to existing graph data structures.

diff --git a/docs/contributing/cpo-implementation.md b/docs/contributing/cpo-implementation.md
@@ -1,7 +1,14 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # CPO Implementation Guide
 
 > How Customization Point Objects work in graph-v3, how to implement new ones, and how to test them.
 
+</td>
+</tr></table>
+
 **References:**
 - [Adjacency List Interface](../reference/adjacency-list-interface.md) — GCI spec for adjacency lists
 - [Edge List Interface](../reference/edge-list-interface.md) — GCI spec for edge lists

diff --git a/docs/contributing/cpo-order.md b/docs/contributing/cpo-order.md
@@ -1,6 +1,14 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Graph CPO Implementation Order
 
-This document specifies the correct implementation order for CPOs in `graph_cpo.hpp`, matching the reference implementation structure.
+
+> This document specifies the correct implementation order for CPOs in `graph_cpo.hpp`, matching the reference implementation structure.
+
+</td>
+</tr></table>
 
 ## CPO Implementation Order
 

diff --git a/docs/contributing/view-chaining.md b/docs/contributing/view-chaining.md
@@ -1,5 +1,12 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # View Chaining — How It Works
 
+</td>
+</tr></table>
+
 ## Overview
 
 Graph views in graph-v3 support **full C++20 range chaining with `std::views`**, including

diff --git a/docs/contributing/view-template.md b/docs/contributing/view-template.md
@@ -1,7 +1,14 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # View Documentation Template
 
-This template provides a standardized format for documenting graph views in the graph-v3 library. Follow this structure to ensure consistency and completeness across all view documentation.
 
+> This template provides a standardized format for documenting graph views in the graph-v3 library. Follow this structure to ensure consistency and completeness across all view documentation.
+
+</td>
+</tr></table>
 ## View Name
 
 ### Brief Description

diff --git a/docs/getting-started.md b/docs/getting-started.md
@@ -1,10 +1,18 @@
+<table><tr>
+<td><img src="assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Getting Started
 
-> [← Back to Documentation Index](index.md)
 
-This guide walks you through installing graph-v3, building your first graph,
+> This guide walks you through installing graph-v3, building your first graph,
 running an algorithm, and working with edge lists.
 
+</td>
+</tr></table>
+
+> [← Back to Documentation Index](index.md)
+
 ---
 
 ## 1. Requirements

diff --git a/docs/index.md b/docs/index.md
@@ -8,7 +8,6 @@
 
 </td>
 </tr></table>
-
 ---
 
 ## For Users
@@ -17,9 +16,9 @@
 - [Adjacency Lists](user-guide/adjacency-lists.md) — range-of-ranges model, concepts, CPOs
 - [Edge Lists](user-guide/edge-lists.md) — flat sourced-edge model, concepts, patterns
 - [Containers](user-guide/containers.md) — `dynamic_graph`, `compressed_graph`, `undirected_adjacency_list`, 27 trait combinations
-- [Views](user-guide/views.md) — lazy traversal views (BFS, DFS, topological sort, etc.)
+- [Views](user-guide/views.md) — lazy traversal views (breadth-first search, depth-first search, topological sort, etc.)
 - [Bidirectional Access](user-guide/bidirectional-access.md) — incoming edges, reverse traversal, `in_edge_accessor`
-- [Algorithms](user-guide/algorithms.md) — Dijkstra, Bellman-Ford, MST, connected components, and more
+- [Algorithms](user-guide/algorithms.md) — Dijkstra and Bellman-Ford shortest-paths, minimal spanning tree, connected components, and more
 
 ## Reference
 
@@ -45,6 +44,7 @@
 ## Other
 
 - [FAQ](FAQ.md) — common questions and answers
-- [Migration from v2](migration-from-v2.md) — what changed from graph-v2 and how to migrate
 - [Status & Metrics](status/metrics.md) — canonical counts and implementation matrix
 - [Code Coverage](status/coverage.md) — line and function coverage report (95.8% lines, 92.0% functions)
+- [C++ Standardization](standardization.md) — ISO C++ proposal papers (P3126–P3131, P3337) and participation
+- [Migration from v2](migration-from-v2.md) — what changed from graph-v2 and how to migrate
diff --git a/docs/migration-from-v2.md b/docs/migration-from-v2.md
@@ -1,5 +1,12 @@
+<table><tr>
+<td><img src="assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Migrating from graph-v2 to graph-v3
 
+</td>
+</tr></table>
+
 > [← Back to Documentation Index](index.md)
 
 ## Overview

diff --git a/docs/reference/adjacency-list-interface.md b/docs/reference/adjacency-list-interface.md
@@ -1,10 +1,18 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Adjacency List Interface Reference
 
-> [← Back to Documentation Index](../index.md) · [User Guide: Adjacency Lists](../user-guide/adjacency-lists.md)
 
-This is the formal **Graph Container Interface (GCI)** specification for
+> This is the formal **Graph Container Interface (GCI)** specification for
 adjacency lists, derived from P1709/D3130.
 
+</td>
+</tr></table>
+
+> [← Back to Documentation Index](../index.md) · [User Guide: Adjacency Lists](../user-guide/adjacency-lists.md)
+
 ---
 
 ## Concepts

diff --git a/docs/reference/algorithm-complexity.md b/docs/reference/algorithm-complexity.md
@@ -1,10 +1,18 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Algorithm Complexity Cheat Sheet
 
-> [← Back to Documentation Index](../index.md) · [User Guide: Algorithms](../user-guide/algorithms.md)
 
-Quick-reference for time complexity, space complexity, required concepts, and
+> Quick-reference for time complexity, space complexity, required concepts, and
 headers for every algorithm in graph-v3.
 
+</td>
+</tr></table>
+
+> [← Back to Documentation Index](../index.md) · [User Guide: Algorithms](../user-guide/algorithms.md)
+
 ---
 
 ## Shortest Paths

diff --git a/docs/reference/concepts.md b/docs/reference/concepts.md
@@ -1,11 +1,19 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # Concepts Reference
 
-> [← Back to Documentation Index](../index.md) · [CPO Reference](cpo-reference.md)
 
-All graph concepts live in `namespace graph::adj_list` (adjacency lists) or
+> All graph concepts live in `namespace graph::adj_list` (adjacency lists) or
 `namespace graph::edge_list` (edge lists) and are re-exported into
 `namespace graph` via `<graph/graph.hpp>`.
 
+</td>
+</tr></table>
+
+> [← Back to Documentation Index](../index.md) · [CPO Reference](cpo-reference.md)
+
 ---
 
 ## Adjacency List Concepts

diff --git a/docs/reference/cpo-reference.md b/docs/reference/cpo-reference.md
@@ -1,7 +1,15 @@
+<table><tr>
+<td><img src="../assets/logo.svg" width="120" alt="graph-v3 logo"></td>
+<td>
+
 # CPO Reference
 
+</td>
+</tr></table>
+
 > [← Back to Documentation Index](../index.md) · [CPO Implementation Guide](../contributing/cpo-implementation.md)
 
+
 **Customization Point Objects (CPOs)** are the primary API for querying graph
 structure. Each CPO resolves at compile time via a three-step priority:
 1. Member function on the graph/edge type