[Boost-commit] svn:boost r64023 - trunk/libs/graph/doc

Subject: [Boost-commit] svn:boost r64023 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2010-07-14 16:34:02

Author: jewillco
Date: 2010-07-14 16:34:02 EDT (Wed, 14 Jul 2010)
New Revision: 64023
URL: http://svn.boost.org/trac/boost/changeset/64023

Log:
Fixed various bugs in docs
Text files modified: 
   trunk/libs/graph/doc/AStarVisitor.html |     2 +-                                      
   trunk/libs/graph/doc/astar_search.html |     2 +-                                      
   trunk/libs/graph/doc/grid_graph.html   |    12 ++++++------                            
   3 files changed, 8 insertions(+), 8 deletions(-)

Modified: trunk/libs/graph/doc/AStarVisitor.html
==============================================================================
--- trunk/libs/graph/doc/AStarVisitor.html	(original)
+++ trunk/libs/graph/doc/AStarVisitor.html	2010-07-14 16:34:02 EDT (Wed, 14 Jul 2010)
@@ -49,7 +49,7 @@
 
 <TR>
 <TD><tt>g</tt></TD>
-<TD>An object of type <tt>G</tt>.</TD>
+<TD>An object of type <tt>const G&amp;</tt>.</TD>
 </TR>
 
 <TR>

Modified: trunk/libs/graph/doc/astar_search.html
==============================================================================
--- trunk/libs/graph/doc/astar_search.html	(original)
+++ trunk/libs/graph/doc/astar_search.html	2010-07-14 16:34:02 EDT (Wed, 14 Jul 2010)
@@ -473,7 +473,7 @@
   is invoked on each out-edge of a vertex immediately after it is
   examined.
 <li><b><tt>vis.edge_relaxed(e, g)</tt></b>
-  is invoked on edge <i>(u,v)</i> if <i>d[u] + w(u,v) < d[v]</i>.
+  is invoked on edge <i>(u,v)</i> if <i>d[u] + w(u,v) &lt; d[v]</i>.
 <li><b><tt>vis.edge_not_relaxed(e, g)</tt></b>
   is invoked if the edge is not relaxed (see above).
 <li><b><tt>vis.black_target(e, g)</tt></b>

Modified: trunk/libs/graph/doc/grid_graph.html
==============================================================================
--- trunk/libs/graph/doc/grid_graph.html	(original)
+++ trunk/libs/graph/doc/grid_graph.html	2010-07-14 16:34:02 EDT (Wed, 14 Jul 2010)
@@ -152,8 +152,8 @@
 <span class="comment">// Get the index associated with vertex</span>
 <span class="name">Traits</span>::<span class="type">vertices_size_type</span>
 get(<span class="name">boost</span>::<span class="type">vertex_index_t</span>,
-    <span class="name">Traits</span>::<span class="type">vertex_descriptor</span> vertex,
-    <span class="keyword">const</span> <span class="name">Graph&amp;</span> graph);
+    <span class="keyword">const</span> <span class="name">Graph&amp;</span> graph,
+    <span class="name">Traits</span>::<span class="type">vertex_descriptor</span> vertex);
 
 <span class="comment">// Get the edge associated with edge_index</span>
 <span class="name">Traits</span>::<span class="type">edge_descriptor</span>
@@ -163,8 +163,8 @@
 <span class="comment">// Get the index associated with edge</span>
 <span class="name">Traits</span>::<span class="type">edges_size_type</span>
 get(<span class="name">boost</span>::<span class="type">edge_index_t</span>,
-    <span class="name">Traits</span>::<span class="type">edge_descriptor</span> edge,
-    <span class="keyword">const</span> <span class="name">Graph&amp;</span> graph);
+    <span class="keyword">const</span> <span class="name">Graph&amp;</span> graph,
+    <span class="name">Traits</span>::<span class="type">edge_descriptor</span> edge);
 
 <span class="comment">// Get the out-edge associated with vertex and out_edge_index</span>
 <span class="name">Traits</span>::<span class="type">edge_descriptor</span>
@@ -190,7 +190,7 @@
 
 <span class="comment">// Do a round-trip test of the vertex index functions</span>
 <span class="keyword">for</span> (<span class="name">Traits</span>::<span class="type">vertices_size_type</span> v_index = <span class="literal">0</span>;
-     v_index < num_vertices(graph); ++v_index) {
+     v_index &lt; num_vertices(graph); ++v_index) {
 
   <span class="comment">// The two indices should always be equal</span>
   <span class="name">std</span>::cout &lt;&lt; <span class="literal">&quot;Index of vertex &quot;</span> &lt;&lt; v_index &lt;&lt; <span class="literal">&quot; is &quot;</span> &lt;&lt;
@@ -200,7 +200,7 @@
 
 <span class="comment">// Do a round-trip test of the edge index functions</span>
 <span class="keyword">for</span> (<span class="name">Traits</span>::<span class="type">edges_size_type</span> e_index = <span class="literal">0</span>;
-     e_index < num_edges(graph); ++e_index) {
+     e_index &lt; num_edges(graph); ++e_index) {
 
   <span class="comment">// The two indices should always be equal</span>
   <span class="name">std</span>::cout &lt;&lt; <span class="literal">&quot;Index of edge &quot;</span> &lt;&lt; e_index &lt;&lt; <span class="literal">&quot; is &quot;</span> &lt;&lt;