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

Subject: [Boost-commit] svn:boost r63466 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2010-07-01 00:46:13

Author: jewillco
Date: 2010-07-01 00:46:09 EDT (Thu, 01 Jul 2010)
New Revision: 63466
URL: http://svn.boost.org/trac/boost/changeset/63466

Log:
Fixed various BGL documentation bugs; fixes #4386
Text files modified: 
   trunk/libs/graph/doc/astar_search.html   |     6 +++---                                  
   trunk/libs/graph/doc/graph_concepts.html |     4 ++--                                    
   2 files changed, 5 insertions(+), 5 deletions(-)

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-01 00:46:09 EDT (Thu, 01 Jul 2010)
@@ -52,7 +52,7 @@
    CostInf inf, CostZero zero);
 
 <i>// Version that does not initialize property maps (used for implicit graphs)</i>
-template &lt;typename VertexListGraph, typename AStarHeuristic,
+template &lt;typename IncidenceGraph, typename AStarHeuristic,
           typename AStarVisitor, typename PredecessorMap,
           typename CostMap, typename DistanceMap,
           typename WeightMap, typename ColorMap,
@@ -61,8 +61,8 @@
           typename CostInf, typename CostZero&gt;
 inline void
 astar_search_no_init
-  (VertexListGraph &amp;g,
-   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
+  (IncidenceGraph &amp;g,
+   typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
    AStarHeuristic h, AStarVisitor vis,
    PredecessorMap predecessor, CostMap cost,
    DistanceMap distance, WeightMap weight,

Modified: trunk/libs/graph/doc/graph_concepts.html
==============================================================================
--- trunk/libs/graph/doc/graph_concepts.html	(original)
+++ trunk/libs/graph/doc/graph_concepts.html	2010-07-01 00:46:09 EDT (Thu, 01 Jul 2010)
@@ -30,7 +30,7 @@
 
 <P>
 The BGL interface does not appear as a single graph concept.  Instead
-it is factored into much smaller peices. The reason for this is that
+it is factored into much smaller pieces. The reason for this is that
 the purpose of a concept is to summarize the requirements for
 <i>particular</i> algorithms. Any one algorithm does not need every
 kind of graph operation, typically only a small subset.  Furthermore,
@@ -224,7 +224,7 @@
 <!---------------------------------------------------------------->
 <TR><TD ALIGN="LEFT" COLSPAN=2>  
 <a href="./VertexListGraph.html">VertexListGraph</a> refines
-  IncidenceGraph and AdjacencyGraph </TD>
+  Graph</TD>
 </TR>
 <TR><TD ALIGN="LEFT">  
 <TT>boost::graph_traits&lt;G&gt;::vertex_iterator</TT> </TD>