1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
|
<HTML>
<!--
-- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
--
-- 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)
-->
<Head>
<Title>Table of Contents: Boost Graph Library</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
ALINK="#ff0000">
<IMG SRC="../../../boost.png"
ALT="C++ Boost" width="277" height="86">
<BR Clear>
<h1>Table of Contents: the Boost Graph Library
<a href="http://www.awprofessional.com/title/0201729148">
<img src="bgl-cover.jpg" ALT="BGL Book" ALIGN="RIGHT"></a>
</h1>
<OL>
<LI><A Href="./index.html">Introduction to the BGL</A>
<LI><A Href="./history.html">History</A>
<LI><A Href="./users.html">List of BGL Users</A>
<LI><A Href="./publications.html">Publications</A>
<LI><A Href="./acknowledgements.html">Acknowledgements</A>
<LI><A href="./quick_tour.html">A Quick Tour of the Boost Graph Library.</a>
<LI><A Href="graph_theory_review.html">Review of Elementary Graph Theory</A>
<LI>Boost Graph Library Tutorial
<OL>
<LI><a
href="./using_property_maps.html">Property Maps</a>
<LI><a
href="./using_adjacency_list.html">The <tt>adjacency_list</tt> class</a>
</OL>
<LI>Examples
<OL>
<LI><a href="./file_dependency_example.html">File
Dependency Example</a>
<LI><a href="./kevin_bacon.html">Six Degrees of Kevin Bacon</a>
<LI><a href="./graph_coloring.html">Graph Coloring</a>
<LI><a href="./sparse_matrix_ordering.html">Sparse Matrix
Ordering</a>
</OL>
<LI>Extending the Boost Graph Library
<OL>
<LI><a href="./constructing_algorithms.html">Constructing graph algorithms with BGL</a>
<LI><a href="./leda_conversion.html">Converting Existing Graphs to BGL</a>
</OL>
<LI><A href="./graph_concepts.html">The Boost Graph Interface</A>
<OL>
<LI><A href="./Graph.html">Graph</A>
<LI><A href="./IncidenceGraph.html">Incidence Graph</A>
<LI><A href="./BidirectionalGraph.html">Bidirectional Graph</A>
<LI><A href="./AdjacencyGraph.html">Adjacency Graph</A>
<LI><A href="./VertexListGraph.html">Vertex List Graph</A>
<LI><A href="./EdgeListGraph.html">Edge List Graph</A>
<LI><A href="./VertexAndEdgeListGraph.html">Vertex and Edge List Graph</A>
<LI><A href="./MutableGraph.html">Mutable Graph</A>
<LI><A href="./PropertyGraph.html">Property Graph</A>
<LI><A href="./MutablePropertyGraph.html">Mutable Property Graph</A>
</OL>
<li><a href="../../property_map/property_map.html">The Property Map Library</a> (technically not part of the graph library, but used a lot here)
<li><img src="figs/python_ico.gif" alt="(Python)"/><a href="python.html">Python bindings</a></li>
<li><a href="./visitor_concepts.html">Visitor Concepts</a>
<OL>
<LI><a href="./BFSVisitor.html">BFS Visitor</a>
<LI><a href="./DFSVisitor.html">DFS Visitor</a>
<LI><a href="./DFSVisitor.html"><a href="./DijkstraVisitor.html">Dijkstra Visitor</a>
<LI><a href="./BellmanFordVisitor.html">Bellman Ford Visitor</a>
<LI><a href="AStarVisitor.html">A* Visitor</a></LI>
<LI><a href="./EventVisitor.html">Event Visitor</a>
</OL>
<li>EventVisitorList Adaptors
<OL>
<LI><a href="./EventVisitorList.html">Event Visitor List</a>
<LI><a href="./bfs_visitor.html"><tt>bfs_visitor</tt></a>
<LI><a href="./dfs_visitor.html"><tt>dfs_visitor</tt></a>
<LI><a href="./dijkstra_visitor.html"><tt>dijkstra_visitor</tt></a>
<LI><a href="./bellman_visitor.html"><tt>bellman_visitor</tt></a>
<li><a href="astar_visitor.html"><tt>astar_visitor</tt></a></li>
</OL>
<li>Event Visitors
<OL>
<LI><a href="./predecessor_recorder.html"><tt>predecessor_recorder</tt></a>
<LI><a href="./distance_recorder.html"><tt>distance_recorder</tt></a>
<LI><a href="./time_stamper.html"><tt>time_stamper</tt></a>
<LI><a href="./property_writer.html"><tt>property_writer</tt></a>
</OL>
<LI>Graph classes
<OL>
<LI><A href="./adjacency_list.html"><tt>adjacency_list</tt></a></li>
<LI><A href="./adjacency_matrix.html"><tt>adjacency_matrix</tt></a></li>
<li><a href="compressed_sparse_row.html"><tt>compressed_sparse_row_graph</tt></a></li>
</OL></li>
<LI>Graph Adaptors
<OL>
<LI><A href="./subgraph.html"><tt>subgraph</tt></A>
<LI><A href="./edge_list.html"><tt>edge_list</tt></A>
<LI><A href="./reverse_graph.html"><tt>reverse_graph</tt></A>
<LI><A href="./filtered_graph.html"><tt>filtered_graph</tt></A>
<LI><A href="../../../boost/graph/vector_as_graph.hpp">Vector as Graph </A><a href="#*">*</a>
<LI><A href="../../../boost/graph/matrix_as_graph.hpp">Matrix as Graph</A><a href="#*">*</a>
<LI><A href="../../../boost/graph/leda_graph.hpp">Leda Graph </A><a href="#*">*</a>
<LI><A href="./stanford_graph.html">Stanford GraphBase</A>
</OL>
<LI>Iterator Adaptors
<OL>
<LI><a
href="./adjacency_iterator.html"><tt>adjacency_iterator</tt></a>
<LI><a
href="./inv_adjacency_iterator.html"><tt>inv_adjacency_iterator</tt></a>
</OL>
<LI>Traits classes
<OL>
<LI><a href="./graph_traits.html"><tt>graph_traits</tt></a>
<LI><a href="./adjacency_list_traits.html"><tt>adjacency_list_traits</tt></a>
<LI><a href="./property_map.html"><tt>property_map</tt></a>
</OL>
<LI>Algorithms
<OL>
<LI><a href="./bgl_named_params.html"><tt>bgl_named_params</tt></a>
<LI>Core Algorithm Patterns
<OL>
<LI><A href="./breadth_first_search.html"><tt>breadth_first_search</tt></A>
<LI><A href="./breadth_first_search.html"><A href="./breadth_first_visit.html"><tt>breadth_first_visit</tt></A>
<LI><A
href="./depth_first_search.html"><tt>depth_first_search</tt></A>
<LI><A href="./depth_first_visit.html"><tt>depth_first_visit</tt></A>
<LI><A
href="./undirected_dfs.html"><tt>undirected_dfs</tt></A>
</OL>
<LI>Graph Algorithms
<OL>
<LI>Shortest Paths Algorithms
<OL>
<LI><A href="./dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></A>
<LI><A href="./bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></A>
<LI><A href="./dag_shortest_paths.html"><tt>dag_shortest_paths</tt></A>
<LI><A
href="./johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
<li><a href="floyd_warshall_shortest.html"><tt>floyd_warshall_all_pairs_shortest_paths</tt></a></li>
</OL>
<LI>Minimum Spanning Tree Algorithms
<OL>
<LI><A
href="./kruskal_min_spanning_tree.html"><tt>kruskal_minimum_spanning_tree</tt></A>
<LI><A
href="./prim_minimum_spanning_tree.html"><tt>prim_minimum_spanning_tree</tt></A>
</OL>
<LI>Connected Components Algorithms
<OL>
<LI><A href="./connected_components.html"><tt>connected_components</tt></A>
<LI><A href="./strong_components.html"><tt>strong_components</tt></A>
<LI><a href="biconnected_components.html"><tt>biconnected_components</tt></a>
<LI><a href="biconnected_components.html#sec:articulation_points"><tt>articulation_points</tt></a>
<LI><a href="./incremental_components.html">Incremental Connected Components</a>
<OL>
<LI><A href="./incremental_components.html#sec:initialize-incremental-components"><tt>initialize_incremental_components</tt></A>
<LI><A href="./incremental_components.html#sec:incremental-components"><tt>incremental_components</tt></A>
<LI><A
href="./incremental_components.html#sec:same-component"><tt>same_component</tt></A>
<LI><A href="./incremental_components.html#sec:component-index"><tt>component_index</tt></A>
</OL>
</OL></LI>
<LI>Maximum Flow and Matching Algorithms
<OL>
<LI><A href="./edmunds_karp_max_flow.html"><tt>edmunds_karp_max_flow</tt></A>
<LI><A href="./push_relabel_max_flow.html"><tt>push_relabel_max_flow</tt></A>
<LI><A href="./maximum_matching.html"><tt>edmonds_maximum_cardinality_matching</tt></A>
</OL>
<li>Sparse Matrix Ordering Algorithms
<ol>
<LI><A
href="./cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering</tt></a>
<li><a href="king_ordering.html"><tt>king_ordering</tt></a></li>
<LI><a href="./minimum_degree_ordering.html"><tt>minimum_degree_ordering</tt></a>
</ol>
</li>
<LI><A href="./topological_sort.html"><tt>topological_sort</tt></A>
<li><a href="./transitive_closure.html"><tt>transitive_closure</tt></a>
<LI><A href="./copy_graph.html"><tt>copy_graph</tt></A>
<LI><A href="./transpose_graph.html"><tt>transpose_graph</tt></A>
<LI><A href="./isomorphism.html"><tt>isomorphism</tt></A>
<LI><A
href="sequential_vertex_coloring.html"><tt>sequential_vertex_coloring</tt></A>
<li><a href="./sloan_ordering.htm"><tt>sloan_ordering</tt></a></li>
<li><a href="sloan_start_end_vertices.htm"><tt>sloan_start_end_vertices</tt></a></li>
<LI><A href="./wavefront.htm"><tt>ith_wavefront</tt>, <tt>max_wavefront</tt>, <tt>aver_wavefront</tt>, and <tt>rms_wavefront</tt></A></LI>
<LI><A href="betweenness_centrality.html"><tt>brandes_betweenness_centrality</tt></A></LI>
<li>Layout algorithms
<ol>
<li><a href="random_layout.html"><tt>random_graph_layout</tt></a></li>
<li><a href="circle_layout.html"><tt>circle_layout</tt></a></li>
<li><a href="kamada_kawai_spring_layout.html"><tt>kamada_kawai_spring_layout</tt></a></li>
<li><a href="fruchterman_reingold.html"><tt>fruchterman_reingold_force_directed_layout</tt></a></li>
<li><a href="gursoy_atun_layout.html"><tt>gursoy_atun_layout</tt></a></li>
</ol>
</li>
<li>Clustering algorithms
<ol>
<li><a href="bc_clustering.html"><tt>betweenness_centrality_clustering</tt></a></li>
</ol>
</li>
<li><a href="astar_search.html"><tt>astar_search</tt></a></li>
<li><a href="lengauer_tarjan_dominator.htm"><tt>lengauer_tarjan_dominator_tree</tt></a></li>
</OL>
</OL>
<LI>AT&T Graphviz Read/Write Utilities
<OL>
<LI><a href="./write-graphviz.html">write_graphviz</a>
<LI><a href="read_graphviz.html">read_graphviz</a>
</OL>
<LI>Auxiliary Concepts, Classes, and Functions
<OL>
<LI><a href="./property.html"><tt>property</tt></a>
<LI><a href="./ColorValue.html">ColorValue</a>
<LI><a href="./Buffer.html">Buffer</a>
<LI><a href="./BasicMatrix.html">BasicMatrix</a>
<LI><a href="./incident.html"><tt>incident</tt></a>
<LI><a href="./opposite.html"><tt>opposite</tt></a>
<LI><a href="./bandwidth.html#sec:bandwidth"><tt>bandwidth</tt></a>
<LI><a href="./bandwidth.html#sec:ith-bandwidth"><tt>ith_bandwidth</tt></a>
<LI><a href="./random.html">Tools for random graphs</a>
<OL>
<LI><a href="./random.html#random_vertex">random_vertex</a>
<LI><a href="./random.html#random_edge">random_edge</a>
<LI><a href="./random.html#generate_random_graph">generate_random_graph</a>
<LI><a href="./random.html#randomize_property">randomize_property</a>
<li><a href="erdos_renyi_generator.html"><tt>erdos_renyi_iterator</tt></li>
<li><a href="sorted_erdos_renyi_gen.html"><tt>sorted_erdos_renyi_iterator</tt></li>
<li><a href="plod_generator.html"><tt>plod_iterator</tt></li>
<li><a href="small_world_generator.html"><tt>small_world_iterator</tt></li>
</OL>
</OL>
<LI><a href="./challenge.html">Challenge and To-Do List</a>
<LI><a href="./trouble_shooting.html">Trouble Shooting</a>
<LI><a href="./known_problems.html">Known Problems</a>
<LI><a href="./faq.html">FAQ</a>
<LI><a href="http://siek.info/bgl.html">BGL Book Errata</a>
</OL>
<p>
<a name="*">*</a> Items marked have not yet been documented.
<br>
<HR>
<TABLE>
<TR valign=top>
<TD nowrap>Copyright © 2000-2001</TD><TD>
<A HREF="../../../people/jeremy_siek.htm">Jeremy Siek</A>,
Indiana University (<A
HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
<A HREF="../../../people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
<A HREF=http://www.osl.iu.edu/~lums>Andrew Lumsdaine</A>,
Indiana University (<A
HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
</TD></TR></TABLE>
</BODY>
</HTML>
|
