Table of Contents: the Boost Graph Library
Introduction to the BGL
History
List of BGL Users
Publications
Acknowledgements
A Quick Tour of the Boost Graph Library.
Review of Elementary Graph Theory
Boost Graph Library Tutorial
Property Maps
The
adjacency_list
class
Examples
File Dependency Example
Six Degrees of Kevin Bacon
Graph Coloring
Sparse Matrix Ordering
Extending the Boost Graph Library
Constructing graph algorithms with BGL
Converting Existing Graphs to BGL
The Boost Graph Interface
Graph
Incidence Graph
Bidirectional Graph
Adjacency Graph
Vertex List Graph
Edge List Graph
Vertex and Edge List Graph
Mutable Graph
Property Graph
Mutable Property Graph
The Property Map Library
(technically not part of the graph library, but used a lot here)
Python bindings
Visitor Concepts
BFS Visitor
DFS Visitor
Dijkstra Visitor
Bellman Ford Visitor
A* Visitor
Event Visitor
EventVisitorList Adaptors
Event Visitor List
bfs_visitor
dfs_visitor
dijkstra_visitor
bellman_visitor
astar_visitor
Event Visitors
predecessor_recorder
distance_recorder
time_stamper
property_writer
Graph classes
adjacency_list
adjacency_matrix
Graph Adaptors
subgraph
edge_list
reverse_graph
filtered_graph
Vector as Graph
*
Matrix as Graph
*
Leda Graph
*
Stanford GraphBase
Iterator Adaptors
adjacency_iterator
inv_adjacency_iterator
Traits classes
graph_traits
adjacency_list_traits
property_map
Algorithms
bgl_named_params
Core Algorithm Patterns
breadth_first_search
breadth_first_visit
depth_first_search
depth_first_visit
undirected_dfs
Graph Algorithms
Shortest Paths Algorithms
dijkstra_shortest_paths
bellman_ford_shortest_paths
dag_shortest_paths
johnson_all_pairs_shortest_paths
floyd_warshall_all_pairs_shortest_paths
Minimum Spanning Tree Algorithms
kruskal_minimum_spanning_tree
prim_minimum_spanning_tree
Connected Components Algorithms
connected_components
strong_components
biconnected_components
articulation_points
Incremental Connected Components
initialize_incremental_components
incremental_components
same_component
component_index
Maximum Flow Algorithms
edmunds_karp_max_flow
push_relabel_max_flow
Sparse Matrix Ordering Algorithms
cuthill_mckee_ordering
king_ordering
minimum_degree_ordering
topological_sort
transitive_closure
copy_graph
transpose_graph
isomorphism
sequential_vertex_coloring
sloan_ordering
sloan_start_end_vertices
ith_wavefront
,
max_wavefront
,
aver_wavefront
, and
rms_wavefront
brandes_betweenness_centrality
Layout algorithms
random_graph_layout
circle_layout
kamada_kawai_spring_layout
fruchterman_reingold_force_directed_layout
gursoy_atun_layout
Clustering algorithms
betweenness_centrality_clustering
astar_search
AT&T Graphviz Read/Write Utilities
write_graphviz
read_graphviz
Auxiliary Concepts, Classes, and Functions
property
ColorValue
Buffer
BasicMatrix
incident
opposite
bandwidth
ith_bandwidth
Tools for random graphs
random_vertex
random_edge
generate_random_graph
randomize_property
erdos_renyi_iterator
plod_iterator
small_world_iterator
Challenge and To-Do List
Trouble Shooting
Known Problems
FAQ
BGL Book Errata
*
Items marked have not yet been documented.
Copyright © 2000-2001
Jeremy Siek
, Indiana University (
jsiek@osl.iu.edu
)
Lie-Quan Lee
, Indiana University (
llee@cs.indiana.edu
)
Andrew Lumsdaine
, Indiana University (
lums@osl.iu.edu
)