Table of Contents: the Boost Graph Library
- Introduction to the BGL
- Parallel BGL (distributed-memory parallel graph data structures and algorithms)
- History
- List of BGL Users
- Publications
- Acknowledgements
- A Quick Tour of the Boost Graph Library.
- Review of Elementary Graph Theory
- Boost Graph Library Tutorial
- Examples
- Extending the Boost Graph Library
- The Boost Graph Interface
- The Property Map Library (technically not part of the graph library, but used a lot here)
- Python bindings
- Visitor Concepts
- EventVisitorList Adaptors
- Event Visitors
- Graph classes
- Graph Adaptors
- Iterator Adaptors
- Traits classes
- Algorithms
- Named parameters (used in many graph algorithms)
- Basic Operations
- Core Searches
- Other Core Algorithms
- Shortest Paths / Cost Minimization Algorithms
- Minimum Spanning Tree Algorithms
- Random Spanning Tree Algorithm
- Connected Components Algorithms
- Maximum Flow and Matching Algorithms
- Minimum Cut Algorithms
- Sparse Matrix Ordering Algorithms
- Graph Metrics
- Graph Structure Comparisons
- Layout Algorithms
- Clustering algorithms
- Planar Graph Algorithms
- Miscellaneous Algorithms
- metric_tsp_approx
- sequential_vertex_coloring
- is_bipartite (including two-coloring of bipartite graphs)
- find_odd_cycle
- Graph Input/Output
- AT&T Graphviz: read_graphviz, write_graphviz
- DIMACS Max-flow: read_dimacs_max_flow and read_dimacs_min_cut, write_dimacs_max_flow
- GraphML: read_graphml and write_graphml
- Auxiliary Concepts, Classes, and Functions
- Challenge and To-Do List
- Trouble Shooting
- Known Problems
- FAQ
- BGL Book Errata