mirror of
https://github.com/boostorg/graph.git
synced 2026-01-23 05:32:12 +00:00
225 lines
11 KiB
HTML
225 lines
11 KiB
HTML
<HTML>
|
|
<!--
|
|
-- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
|
|
--
|
|
-- Permission to use, copy, modify, distribute and sell this software
|
|
-- and its documentation for any purpose is hereby granted without fee,
|
|
-- provided that the above copyright notice appears in all copies and
|
|
-- that both that copyright notice and this permission notice appear
|
|
-- in supporting documentation. We make no
|
|
-- representations about the suitability of this software for any
|
|
-- purpose. It is provided "as is" without express or implied warranty.
|
|
-->
|
|
<Head>
|
|
<Title>Table of Contents: Boost Graph Library</Title>
|
|
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
|
|
ALINK="#ff0000">
|
|
<IMG SRC="../../../c++boost.gif"
|
|
ALT="C++ Boost" width="277" height="86">
|
|
|
|
<BR Clear>
|
|
|
|
<h1>Table of Contents: the Boost Graph Library
|
|
<a href="http://www.awprofessional.com/catalog/product.asp?product_id={B7B10FCE-2354-4A3E-8792-FCFCECDB355D}">
|
|
<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="./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_graph_algorithms.html">Algorithms</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><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="./DijkstraVisitor.html">Dijkstra Visitor</a>
|
|
<LI><a href="./BellmanFordVisitor.html">Bellman Ford Visitor</a>
|
|
<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>
|
|
</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><A href="./adjacency_matrix.html"><tt>adjacency_matrix</tt></A>
|
|
</OL>
|
|
<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>
|
|
</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_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><tt>uniform_cost_search</tt> (deprecated, use Dijkstra's instead)
|
|
</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>
|
|
</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><A href="./connected_components.html"><tt>connected_components</tt></A>
|
|
<LI><A href="./strong_components.html"><tt>strong_components</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>
|
|
<LI>Maximum Flow 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>
|
|
|
|
</OL>
|
|
|
|
<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="./cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering</tt></a>
|
|
<LI><A
|
|
href="../../../boost/graph/sequential_vertex_coloring.hpp"><tt>sequential_vertex_coloring</tt></A><a
|
|
href="#*">*</a>
|
|
<LI><a href="./minimum_degree_ordering.html"><tt>minimum_degree_ordering</tt></a>
|
|
|
|
</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>
|
|
</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>
|