Home
Getting Started
Data Structures
- Graph classes
- Graph Adaptors
- Implicit Graphs
  - Multi-dimensional grid graph
Algorithms
- Named parameters (used in many graph algorithms)
- Basic Operations
  - copy_graph
  - transpose_graph
- Core Searches
- Other Core Algorithms
- Shortest Paths / Cost Minimization Algorithms
- Minimum Spanning Tree Algorithms
  - kruskal_minimum_spanning_tree
  - prim_minimum_spanning_tree
- Random Spanning Tree Algorithm
  - random_spanning_tree
- Algorithm for Common Spanning Trees of Two Graphs
  - two_graphs_common_spanning_trees
- Connected Components Algorithms
- Maximum Flow and Matching Algorithms
- Minimum Cost Maximum Flow Algorithms
- Minimum Cut Algorithms
  - stoer_wagner_min_cut
- Sparse Matrix Ordering Algorithms
- Graph Metrics
- Graph Structure Comparisons
- Layout Algorithms
- Clustering algorithms
  - betweenness_centrality_clustering
- Planar Graph Algorithms
- Miscellaneous Algorithms
  - metric_tsp_approx
  - sequential_vertex_coloring
  - edge_coloring
  - is_bipartite (including two-coloring of bipartite graphs)
  - find_odd_cycle
  - maximum_adjacency_search
  - hawick_circuits (find all circuits of a directed graph)
Concepts & Interfaces
- The Boost Graph Interface
- The Property Map Library (technically not part of the graph library, but used a lot here)
- Visitor Concepts
- EventVisitorList Adaptors
- Event Visitors
Tools & Utilities
- Iterator Adaptors
  - adjacency_iterator
  - inv_adjacency_iterator
- Traits classes
- 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
Advanced Topics
- Extending the Boost Graph Library
  - Constructing graph algorithms with BGL
  - Converting Existing Graphs to BGL
- Parallel BGL (distributed-memory parallel graph data structures and algorithms)
About the Project

Table of Contents