From ecedcaa5a3acc01445aa9cf7635a62dbab91c232 Mon Sep 17 00:00:00 2001
From: Douglas Gregor
Date: Mon, 17 Mar 2008 17:34:46 +0000
Subject: [PATCH] Fix some documentation issues. Fixes #1655, fixes #1660
[SVN r43680]
---
doc/breadth_first_visit.html | 3 ---
doc/depth_first_search.html | 2 +-
doc/read_graphml.html | 2 +-
doc/read_graphviz.html | 2 +-
doc/sloan_ordering.htm | 2 +-
doc/table_of_contents.html | 2 +-
doc/write_dimacs.html | 2 +-
7 files changed, 6 insertions(+), 9 deletions(-)
diff --git a/doc/breadth_first_visit.html b/doc/breadth_first_visit.html
index 0747b426..c5aa5c1c 100644
--- a/doc/breadth_first_visit.html
+++ b/doc/breadth_first_visit.html
@@ -125,9 +125,6 @@ The time complexity is O(E).
Visitor Event Points
-- vis.initialize_vertex(v, g) is invoked on every vertex
- before the start of the search.
-
- vis.examine_vertex(u, g)r is invoked in each
vertex as it is removed from the queue.
diff --git a/doc/depth_first_search.html b/doc/depth_first_search.html
index ae52e253..838420b6 100644
--- a/doc/depth_first_search.html
+++ b/doc/depth_first_search.html
@@ -66,7 +66,7 @@ The depth_first_search() function invokes user-defined
actions at certain event-points within the algorithm. This provides a
mechanism for adapting the generic DFS algorithm to the many
situations in which it can be used. In the pseudo-code below, the
-event points for DFS are indicated in by the triangles and labels on
+event points for DFS are the labels on
the right. The user-defined actions must be provided in the form of a
visitor object, that is, an object whose type meets the requirements
for a DFS Visitor. In the pseudo-code
diff --git a/doc/read_graphml.html b/doc/read_graphml.html
index 87d096d2..c28c584d 100644
--- a/doc/read_graphml.html
+++ b/doc/read_graphml.html
@@ -113,7 +113,7 @@ graph attribute in the graphml format.
To use the graphml reader, you will need to build and link against
the "bgl-graphml" library. The library can be built by following the
-Boost Jam Build Instructions for the subdirectory libs/graph/build.
+Boost Jam Build Instructions for the subdirectory libs/graph/build.
diff --git a/doc/read_graphviz.html b/doc/read_graphviz.html
index 02758b43..5efc6386 100644
--- a/doc/read_graphviz.html
+++ b/doc/read_graphviz.html
@@ -177,7 +177,7 @@ bool status = read_graphviz(gvgraph,graph,dp,"node_id");
To use the GraphViz readers, you will need to build and link against
the "boost_graph" library. The library can be built by following the
-Boost Jam Build Instructions for the subdirectory libs/graph/build.
+
Boost Jam Build Instructions for the subdirectory
libs/graph/build.
diff --git a/doc/sloan_ordering.htm b/doc/sloan_ordering.htm
index ec99d926..0c13c491 100755
--- a/doc/sloan_ordering.htm
+++ b/doc/sloan_ordering.htm
@@ -203,7 +203,7 @@ For version 1:
See
example/sloan_ordering.cpp.
See Also
-
sloan_start_end_vertices,
+
sloan_start_end_vertices,
bandwidth, profile, wavefront
and degree_property_map in boost/graph/properties.hpp.
diff --git a/doc/table_of_contents.html b/doc/table_of_contents.html
index a23e1f47..50db4e33 100644
--- a/doc/table_of_contents.html
+++ b/doc/table_of_contents.html
@@ -241,7 +241,7 @@
Graph Input/Output
- AT&T Graphviz: read_graphviz, write_graphviz
- - DIMACS Max-flow: read_dimacs_max_flow, write_dimacs
+ - DIMACS Max-flow: read_dimacs_max_flow, write_dimacs_max_flow
- GraphML: read_graphml and write_graphml
diff --git a/doc/write_dimacs.html b/doc/write_dimacs.html
index 07d36a44..636177f0 100644
--- a/doc/write_dimacs.html
+++ b/doc/write_dimacs.html
@@ -42,7 +42,7 @@