|
+ |
# 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** |
 |
++ # Frequently Asked Questions + | +
 |
++ # 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. + + | +
|
++ # Architecture Guide > How graph-v3 is structured, and the design principles behind it. + | +
|
++ # 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. + + | +
|
++ # CPO Implementation Guide > How Customization Point Objects work in graph-v3, how to implement new ones, and how to test them. + | +
|
++ # 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. + + | +
|
++ # View Chaining — How It Works + | +
|
++ # 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. + + | +
|
++ # 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. + | +
|
++ # Migrating from graph-v2 to graph-v3 + | +
|
++ # 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. + | +
|
++ # 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. + | +
|
+
+
# 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 ` |
+
|
++ # CPO Reference + | +
|
+-> [← Back to Documentation Index](../index.md) · [User Guide: Edge Lists](../user-guide/edge-lists.md) +# Edge List Interface Reference -This is the formal **Graph Container Interface (GCI)** specification for edge +> This is the formal **Graph Container Interface (GCI)** specification for edge lists, derived from P1709/D3130. + | +
|
+-## Overview +# Edge Value Type Concepts and Pattern Detection This document describes the concepts and type traits added to `descriptor.hpp` for detecting and categorizing edge value types used in graph descriptors. + | +
|
++ # Type Aliases Reference + + | +
|
+
+
# Vertex Patterns Reference
-> [← Back to Documentation Index](../index.md) · [User Guide: Adjacency Lists](../user-guide/adjacency-lists.md)
-This page documents two complementary concept families for vertex types:
+> This page documents two complementary concept families for vertex types:
**inner value patterns** (how vertex data is accessed) and
**storage patterns** (how vertex IDs are stored/extracted). Both families live
in `graph::adj_list::detail` and are re-exported via ` |
+
|
++ +# C++ Standardization + +> graph-v3 is the reference implementation for a proposed graph library for the **ISO C++ Standard (C++29/C++32)**. + + | +
|
++ # Code Coverage Report + | +
|
++ # Implementation Matrix > **Purpose:** Single source of truth for what is implemented. Generated from the source tree. + + | +
|
++ # Canonical Metrics > **Single source of truth for all user-facing counts.** + + | +
|
+
+
# Adjacency Lists
-> [← Back to Documentation Index](../index.md)
-An **adjacency list** is the primary graph abstraction in graph-v3.
+> An **adjacency list** is the primary graph abstraction in graph-v3.
It models a graph as a *range of vertices*, where each vertex owns a *range of
outgoing edges*. This "range-of-ranges" view maps directly to standard
containers — a `std::vector |
+
|
++ # Algorithms + | +
 |
++ # Articulation Points + | +
|
++ # Bellman-Ford Shortest Paths + | +
|
++ # Breadth-First Search + | +
|
++ # Biconnected Components + | +
|
++ # Connected Components + | +
|
++ # Depth-First Search + | +
|
++ # Dijkstra's Shortest Paths + | +
|
++ # Jaccard Coefficient + | +
|
++ # Label Propagation + | +
|
++ # Maximal Independent Set + | +
|
++ # Minimum Spanning Tree + | +
|
++ # Topological Sort + | +
|
++ # Triangle Count + | +
|
++ # Bidirectional Edge Access + | +
|
++ # Graph Containers -> [← Back to Documentation Index](../index.md) -graph-v3 ships three purpose-built graph containers. Each satisfies the +> graph-v3 ships three purpose-built graph containers. Each satisfies the adjacency list concepts so all CPOs, views, and algorithms work interchangeably. + | +
|
++ # Edge Lists -> [← Back to Documentation Index](../index.md) -An **edge list** is a flat range of sourced edges — a simpler alternative to +> An **edge list** is a flat range of sourced edges — a simpler alternative to the adjacency list when you only need to enumerate edges without fast per-vertex access. Any `std::ranges::input_range` whose elements expose `source_id` and `target_id` qualifies. + | +
|
++ # Graph Views Documentation + | +