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

Subject: [Boost-commit] svn:boost r83844 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2013-04-11 13:14:29

Author: jewillco
Date: 2013-04-11 13:14:28 EDT (Thu, 11 Apr 2013)
New Revision: 83844
URL: http://svn.boost.org/trac/boost/changeset/83844

Log:
Fixed some typos; not a fix to #8428 yet
Text files modified: 
   trunk/libs/graph/doc/johnson_all_pairs_shortest.html |    15 ++++++++-------                         
   1 files changed, 8 insertions(+), 7 deletions(-)

Modified: trunk/libs/graph/doc/johnson_all_pairs_shortest.html
==============================================================================
--- trunk/libs/graph/doc/johnson_all_pairs_shortest.html	(original)
+++ trunk/libs/graph/doc/johnson_all_pairs_shortest.html	2013-04-11 13:14:28 EDT (Thu, 11 Apr 2013)
@@ -15,7 +15,7 @@
 
 <BR Clear>
 
-<H1><A NAME="sec:johnson">
+<H1><A NAME="sec:johnson"></A>
 <TT>johnson_all_pairs_shortest_paths</TT>
 </H1>
 
@@ -75,8 +75,8 @@
 OUT: <tt>DistanceMatrix&amp; D</tt>
 <blockquote>
 The length of the shortest path between each pair of vertices
-<i>u,v</i> in the graph is stored in <tt>D[u][v]</tt>. The set of
-types {<tt>DistanceMatrix, vertices_size_type, D</tt>} must be a model
+<i>u,v</i> in the graph is stored in <tt>D[u][v]</tt>. The tuple of
+types (<tt>DistanceMatrix, vertices_size_type, D</tt>) must be a model
 of BasicMatrix where <tt>D</tt> is the
 value type of the <tt>DistanceMap</tt>.
 </blockquote>
@@ -86,7 +86,7 @@
 
 IN: <tt>weight_map(WeightMap w_map)</tt>   
 <blockquote>
-  The weight or ``length'' of each edge in the graph.
+  The weight or "length" of each edge in the graph.
   The type <tt>WeightMap</tt> must be a model of
   <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The edge descriptor type of
   the graph needs to be usable as the key type for the weight
@@ -127,7 +127,8 @@
   This function is use to compare distances to determine
   which vertex is closer to the source vertex.
   The <tt>CompareFunction</tt> type must be a model of
-  \stlconcept{BinaryPredicate} and have argument types that
+  Binary Predicate
+  and have argument types that
   match the value type of the <tt>WeightMap</tt> property map.<br>
   <b>Default:</b> <tt>std::less&lt;DT&gt;</tt> with
   <tt>DT=typename&nbsp;property_traits&lt;WeightMap&gt;::value_type</tt>
@@ -151,7 +152,7 @@
 <blockquote>
   This value is used to initialize the distance for each
   vertex before the start of the algorithm. 
-  The type <tt>DT</tt> must be the value type of the <tt>WeigthMap</tt>.<br>
+  The type <tt>DT</tt> must be the value type of the <tt>WeightMap</tt>.<br>
   <b>Default:</b> <tt>std::numeric_limits::max()</tt>
 </blockquote>
 
@@ -159,7 +160,7 @@
 <blockquote>
   This value is used to initialize the distance for the source
   vertex before the start of the algorithm.  The type <tt>DT</tt>
-  must be the value type of the <tt>WeigthMap</tt>.<br>
+  must be the value type of the <tt>WeightMap</tt>.<br>
   <b>Default:</b> <tt>0</tt>
 </blockquote>