# Table of Contents: the Boost Graph Library

1. Introduction to the BGL
2. History
3. Publications
4. Acknowledgements
5. A Quick Tour of the Boost Graph Library.
6. Review of Elementary Graph Theory
7. Boost Graph Library Tutorial
   1. Property Maps
   2. Algorithms
   3. The `adjacency_list` class
8. Examples
   1. File Dependency Example
   2. Six Degrees of Kevin Bacon
   3. Graph Coloring
   4. Sparse Matrix Ordering
9. Extending the Boost Graph Library
   1. Constructing graph algorithms with BGL
   2. Converting Existing Graphs to BGL
10. The Boost Graph Interface
    1. Graph
    2. IncidenceGraph
    3. BidirectionalGraph
    4. AdjacencyGraph
    5. VertexListGraph
    6. EdgeListGraph
    7. VertexAndEdgeListGraph
    8. MutableGraph
    9. PropertyGraph
    10. MutablePropertyGraph
11. Visitor Concepts
    1. BFSVisitor
    2. DFSVisitor
    3. UniformCostVisitor
    4. BellmanFordVisitor
    5. EventVisitor
12. EventVisitorList Adaptors
    1. EventVisitorList
    2. `bfs_visitor`
    3. `dfs_visitor`
    4. `ucs_visitor`
    5. `bellman_visitor`
13. Event Visitors
    1. `predecessor_recorder`
    2. `distance_recorder`
    3. `time_stamper`
    4. `property_writer`
14. Graph classes
    1. `adjacency_list`
    2. `adjacency_matrix`
15. Graph Adaptors
    1. `edge_list`
    2. `reverse_graph`
    3. `filtered_graph`
    4. Vector as Graph *
    5. Matrix as Graph *
    6. Leda Graph *
    7. Stanford GraphBase
16. Iterator Adaptors
    1. `adjacency_iterator`
17. Traits classes
    1. `graph_traits`
    2. `adjacency_list_traits`
    3. `property_map`
18. Algorithms
    1. Core Algorithm Patterns
       1. `breadth_first_search`
       2. `depth_first_search`
       3. `depth_first_visit`
       4. `uniform_cost_search`
    2. Graph Algorithms
       1. `dijkstra_shortest_paths`
       2. `bellman_ford_shortest_paths`
       3. `johnson_all_pairs_shortest_paths`
       4. `kruskal_minimum_spanning_tree`
       5. `prim_minimum_spanning_tree`
       6. `connected_components`
       7. `strong_components`
       8. Incremental Dynamic Connected Components
          1. `initialize_incremental_components`
          2. `incremental_components`
          3. `same_component`
          4. `component_index`
       9. Maximum Flow Algorithms
          1. `edmunds_karp_max_flow`
          2. `push_relabel_max_flow`
       10. `topological_sort`
       11. `transpose_graph`
       12. `cuthill_mckee_ordering`
       13. `sequential_vertex_coloring` *
19. Auxiliary Concepts, Classes, and Functions
    1. ColorValue
    2. `incident`
    3. `opposite`
    4. `bandwidth`
    5. `ith_bandwidth`
20. Challenge and To-Do List
21. Trouble Shooting
22. Known Problems
23. FAQ

* Items marked have not yet been documented.

Copyright © 2000 | Jeremy Siek, Univ.of Notre Dame (jsiek@lsc.nd.edu) Lie-Quan Lee, Univ.of Notre Dame (llee1@lsc.nd.edu) Andrew Lumsdaine, Univ.of Notre Dame (lums@lsc.nd.edu)