Chapter 1. Boost.Graph

Table of Contents

Introduction
History
User's Guide
Undirected Graphs
Directed Graphs
The Adjacency List
Concepts
General Concepts
Descriptor
Numeric Value
Degree Measure
Distance Measure
Graph Concepts
Graph
Incidence Graph
Bidirectional Graph
Adjacency Graph
Vertex List Graph
Edge List Graph
Adjacency Matrix
Mutable Graph
Property Graph
Mutable Property Graph
Vertex Index Graph
Edge Index Graph
Visitor Concepts
Visitor
Breadth-First Search Visitor
Depth-First Search Visitor
Dijkstra Visitor
Bellman Ford Visitor
Clique Visitor
Cycle Visitor
Event Visitor
Event Visitor List
Reference
Graph Types
Undirected Graph
Directed Graph
Adjacency List
Edge List
Traits Classes
Exterior Vertex Property
Event Visitor List Adaptors
Event Visitors
Predecessor Recorder
Distance Recorder
Time Stamper
Property Writer
Algorithms
Fundamental
Connectivity
Shortest Paths
Minimum Spanning Tree
Subgraph
Maximum Flow
Sparse Matrix Ordering
Layout
Measures
<libraryinfo> <authorgroup>Jeremy SiekLie-Quan LeeAndrew Lumsdaine</authorgroup> <copyright><year>2000</year><year>2001</year><holder>Jeremy Siek, Lie-Quan Lee, Andrew Lumsdaine</holder></copyright> <legalnotice>

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

</legalnotice> <librarypurpose> Graph data structures and algorithms. </librarypurpose> <librarycategory></librarycategory> </libraryinfo>