mirror of
https://github.com/boostorg/graph.git
synced 2026-02-01 08:32:11 +00:00
166 lines
7.7 KiB
HTML
166 lines
7.7 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">
|
|
|
|
<BR Clear>
|
|
|
|
<h1>Table of Contents: the Boost Graph Library</h1>
|
|
|
|
<OL>
|
|
<LI><A Href="./index.html">Introduction to the
|
|
BGL</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_boost_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_graph_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">IncidenceGraph</A>
|
|
<LI><A href="./BidirectionalGraph.html">BidirectionalGraph</A>
|
|
<LI><A href="./AdjacencyGraph.html">AdjacencyGraph</A>
|
|
<LI><A href="./VertexListGraph.html">VertexListGraph</A>
|
|
<LI><A href="./EdgeListGraph.html">EdgeListGraph</A>
|
|
<LI><A href="./VertexAndEdgeListGraph.html">VertexAndEdgeListGraph</A>
|
|
<LI><A href="./MutableGraph.html">MutableGraph</A>
|
|
<LI><A href="./PropertyGraph.html">PropertyGraph</A>
|
|
<LI><A href="./MutablePropertyGraph.html">MutablePropertyGraph</A>
|
|
</OL>
|
|
<li><a href="./visitor_concepts.html">Visitor Concepts</a>
|
|
<OL>
|
|
<LI><a href="./BFSVisitor.html">BFSVisitor</a>
|
|
<LI><a href="./DFSVisitor.html">DFSVisitor</a>
|
|
<LI><a href="./UniformCostVisitor.html">UniformCostVisitor</a>
|
|
</OL>
|
|
<li>EventVisitorList Adaptors
|
|
<OL>
|
|
<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="./ucs_visitor.html"><tt>ucs_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>
|
|
</OL>
|
|
<LI>Graph Adaptors
|
|
<OL>
|
|
<LI><A href="./edge_list.html"><tt>edge_list</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="../../../boost/graph/stanford_graph.hpp">Stanford Graph</A><a href="#*">*</a>
|
|
</OL>
|
|
<LI>Algorithms
|
|
<OL>
|
|
<LI>Core Algorithm Patterns
|
|
<OL>
|
|
<LI><A href="./breadth_first_search.html"><tt>breadth_first_search</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="./uniform_cost_search.html"><tt>uniform_cost_search</tt></A>
|
|
</OL>
|
|
<LI>Graph Algorithms
|
|
<OL>
|
|
<LI><A href="./dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></A>
|
|
<LI><A href="./bellman_ford_shortest_paths.html"><tt>bellman_ford_shortest_paths</tt></A>
|
|
<LI><A
|
|
href="./johnson_all_pairs_shortest_paths.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
|
|
<LI><A
|
|
href="./kruskal_minimum_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>
|
|
<LI><A href="./connected_components.html"><tt>connected_components</tt></A>
|
|
|
|
<LI><a href="./dynamic_connected_components.html">Dynamic Connected Components</a>
|
|
<OL>
|
|
<LI><A href="./dynamic_connected_components.html#sec:initialize-dynamic-components"><tt>initialize_dynamic_components</tt></A>
|
|
<LI><A href="./dynamic_connected_components.html#sec:dynamic-connected-components"><tt>dynamic_connected_components</tt></A>
|
|
<LI><A
|
|
href="./dynamic_connected_components.html#sec:same-component"><tt>same_component</tt></A>
|
|
<LI><A href="./dynamic_connected_components.html#sec:component-index"><tt>component_index</tt></A>
|
|
</OL>
|
|
<LI><A href="./topological_sort.html"><tt>topological_sort</tt></A>
|
|
<LI><A href="./transpose_graph.html"><tt>transpose_graph</tt></A>
|
|
<LI><A
|
|
href="./cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering</tt></A><a href="#*">*</a>
|
|
<LI><A
|
|
href="./sequential_vertex_ordering.html"><tt>sequential_vertex_ordering</tt></A><a
|
|
href="#*">*</a>
|
|
|
|
</OL>
|
|
</OL>
|
|
|
|
<LI>Auxiliary Concepts, Classes, and Functions
|
|
<OL>
|
|
<LI><a href="./ColorValue.html">ColorValue</a>
|
|
<LI><a href="./incident.html">incident</a>
|
|
<LI><a href="./opposite.html">opposite</a>
|
|
</OL>
|
|
<LI><a href="./challenge.html">Challenge and To-Do List</a>
|
|
</OL>
|
|
<p>
|
|
|
|
<a name="*">*</a> Items marked have not yet been documented.
|
|
|
|
<br>
|
|
<HR>
|
|
<TABLE>
|
|
<TR valign=top>
|
|
<TD nowrap>Copyright © 2000</TD><TD>
|
|
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>,
|
|
Univ.of Notre Dame (<A
|
|
HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br>
|
|
<A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br>
|
|
<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
|
|
Univ.of Notre Dame (<A
|
|
HREF="mailto:lums@lsc.nd.edu">lums@lsc.nd.edu</A>)
|
|
</TD></TR></TABLE>
|
|
|
|
</BODY>
|
|
</HTML>
|