Python
To implement a model of the DijkstraVisitor concept in Python, diff --git a/doc/adjacency_iterator.html b/doc/adjacency_iterator.html index b82a9788..d1adc438 100644 --- a/doc/adjacency_iterator.html +++ b/doc/adjacency_iterator.html @@ -35,7 +35,7 @@ namespace boost { template <class Graph, class VertexDescriptor, class OutEdgeIter> class adjacency_iterator_generator { public: - typedef iterator_adaptor<...> type; + typedef iterator_adaptor<...> type; }; } diff --git a/doc/breadth_first_search.html b/doc/breadth_first_search.html index 0aab22c9..c99ba3c8 100644 --- a/doc/breadth_first_search.html +++ b/doc/breadth_first_search.html @@ -242,7 +242,7 @@ UTIL: buffer(Buffer& Q) Default: boost::queuePython: The buffer must derive from the Buffer type for the graph. + href="./Buffer.html">Buffer type for the graph. diff --git a/doc/breadth_first_visit.html b/doc/breadth_first_visit.html index 481ab38f..d7bda494 100644 --- a/doc/breadth_first_visit.html +++ b/doc/breadth_first_visit.html @@ -113,7 +113,7 @@ UTIL: buffer(Buffer& Q) Default: boost::queue
Python: The buffer must derive from the Buffer type for the graph. + href="./Buffer.html">Buffer type for the graph. diff --git a/doc/challenge.html b/doc/challenge.html index 8bb707b5..19b1f839 100644 --- a/doc/challenge.html +++ b/doc/challenge.html @@ -26,9 +26,9 @@
- Dynamic graph algorithms such as described in Dynamic Graph +href="http://citeseer.ist.psu.edu/eppstein99dynamic.html">Dynamic Graph Algorithms and A Software +href="http://citeseer.ist.psu.edu/alberts98software.html">A Software Library of Dynamic Graph Algorithms.
- Polish up code/docs for pending items and champion the formal
diff --git a/doc/cuthill_mckee_ordering.html b/doc/cuthill_mckee_ordering.html
index 90582818..9c63e62f 100644
--- a/doc/cuthill_mckee_ordering.html
+++ b/doc/cuthill_mckee_ordering.html
@@ -83,7 +83,7 @@ The goal of the Cuthill-Mckee (and reverse Cuthill-Mckee) ordering
algorithm[14, 43, 44, 44, 45 ] is to reduce the bandwidth of a graph by reordering the
indices assigned to each vertex. The Cuthill-Mckee ordering algorithm
diff --git a/doc/dag_shortest_paths.html b/doc/dag_shortest_paths.html
index 4e969b58..cb9d79ef 100644
--- a/doc/dag_shortest_paths.html
+++ b/doc/dag_shortest_paths.html
@@ -54,7 +54,7 @@ than either the Dijkstra or Bellman-Ford algorithm.
Use breadth-first search instead of this algorithm
when all edge weights are equal to one. For the definition of the
shortest-path problem see Section Shortest-Paths
+HREF="graph_theory_review.html#sec:shortest-paths-algorithms">Shortest-Paths
Algorithms for some background to the shortest-path problem.
diff --git a/doc/depth_first_visit.html b/doc/depth_first_visit.html
index afae5dd1..c14fba42 100644
--- a/doc/depth_first_visit.html
+++ b/doc/depth_first_visit.html
@@ -27,12 +27,12 @@
-template <class IncidenceGraph, class DFSVisitor, class ColorMap> +template <class IncidenceGraph, class DFSVisitor, class ColorMap> void depth_first_visit(IncidenceGraph& g, typename graph_traits<IncidenceGraph>::vertex_descriptor s, DFSVisitor& vis, ColorMap color) -template <class IncidenceGraph, class DFSVisitor, class ColorMap, +template <class IncidenceGraph, class DFSVisitor, class ColorMap, class TerminatorFunc> void depth_first_visit(IncidenceGraph& g, typename graph_traits<IncidenceGraph>::vertex_descriptor s, diff --git a/doc/dijkstra_shortest_paths.html b/doc/dijkstra_shortest_paths.html index ba59d342..d907d04f 100644 --- a/doc/dijkstra_shortest_paths.html +++ b/doc/dijkstra_shortest_paths.html @@ -56,7 +56,7 @@ algorithm for the case when some edge weights are negative. Use breadth-first search instead of Dijkstra's algorithm when all edge weights are equal to one. For the definition of the shortest-path problem see Section Shortest-Paths +HREF="graph_theory_review.html#sec:shortest-paths-algorithms">Shortest-Paths Algorithms for some background to the shortest-path problem. diff --git a/doc/graph_theory_review.html b/doc/graph_theory_review.html index ca4ecc22..65823bbb 100644 --- a/doc/graph_theory_review.html +++ b/doc/graph_theory_review.html @@ -29,7 +29,7 @@ the reader has some previous acquaintance with graph algorithms, this chapter should be enough to get started. If the reader has no previous background in graph algorithms we suggest a more thorough introduction such as Introduction to Algorithms +href="http://toc.lcs.mit.edu/~clr/">Introduction to Algorithms by Cormen, Leiserson, and Rivest.
diff --git a/doc/kruskal_min_spanning_tree.html b/doc/kruskal_min_spanning_tree.html index ae17be96..b8554c63 100644 --- a/doc/kruskal_min_spanning_tree.html +++ b/doc/kruskal_min_spanning_tree.html @@ -95,7 +95,7 @@ IN: const Graph& g IN: OutputIterator spanning_tree_edgesdiff --git a/doc/incremental_components.html b/doc/incremental_components.html index 752cb6d0..bbac574d 100644 --- a/doc/incremental_components.html +++ b/doc/incremental_components.html @@ -35,7 +35,7 @@ the situation where edges are both added and removed from the graph, hence it is called incremental[42] (and not fully dynamic). The disjoint-sets class is described in Section Disjoint Sets. +HREF="../disjoint_sets/disjoint_sets.html">Disjoint Sets.
The following five operations are the primary functions that you will diff --git a/doc/inv_adjacency_iterator.html b/doc/inv_adjacency_iterator.html index 02c1cb59..be851a16 100644 --- a/doc/inv_adjacency_iterator.html +++ b/doc/inv_adjacency_iterator.html @@ -37,7 +37,7 @@ namespace boost { template <class Graph, class VertexDescriptor, class InEdgeIter> class inv_adjacency_iterator_generator { public: - typedef iterator_adaptor<...> type; + typedef iterator_adaptor<...> type; }; }
The edges of the minimum spanning tree are output to this Output + href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator.
Python: This parameter is not used in Python. Instead, a diff --git a/doc/layout_tolerance.html b/doc/layout_tolerance.html index 67a13147..fa01ca9a 100644 --- a/doc/layout_tolerance.html +++ b/doc/layout_tolerance.html @@ -1,6 +1,6 @@Struct template layout_tolerance 
Home Libraries People FAQ More Struct template layout_tolerance
boost::layout_tolerance — Determines when to terminate layout of a particular graph based on a given relative tolerance.
Synopsis
template<typename T = double> struct layout_tolerance { - // construct/copy/destruct + // construct/copy/destruct layout_tolerance(const T & = T(0.001)); // public member functions diff --git a/doc/publications.html b/doc/publications.html index 81e243b0..cd612dae 100644 --- a/doc/publications.html +++ b/doc/publications.html @@ -26,8 +26,8 @@
- Dr. Dobb's Sept. 2000 Article
- OOPSLA'99 GGCL Paper
- Lie-Quan Lee's Master's Thesis about GGCL(ps) (pdf)
-- Dietmar Kühl's Master's Thesis: Design Pattern for the Implementation of Graph Algorithms
-- ISCOPE'99 Sparse Matrix Ordering (pdf)
+- Dietmar Kühl's Master's Thesis: Design Pattern for the Implementation of Graph Algorithms
+- ISCOPE'99 Sparse Matrix Ordering (pdf)
- C++ Template Workshop 2000, Concept Checking
diff --git a/doc/sloan_start_end_vertices.htm b/doc/sloan_start_end_vertices.htm index 22d7dcf0..ffffbec8 100755 --- a/doc/sloan_start_end_vertices.htm +++ b/doc/sloan_start_end_vertices.htm @@ -68,10 +68,10 @@ For version 1: See example/sloan_ordering.cpp.See Also
-sloan_start_end_vertices, bandwidth, profile, - wavefront and +href="http://www.boost.org/libs/graph/doc/bandwidth.html">bandwidth, profile, + wavefront and degree_property_map in boost/graph/properties.hpp.
[1] S. W. Sloan, An algorithm for profile and wavefront reduction of sparse matrices, Int. j. numer. methods eng., 23, 239 - 251 (1986)