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

Subject: [Boost-commit] svn:boost r63227 - trunk/libs/graph/doc
From: asutton_at_[hidden]
Date: 2010-06-22 09:11:06

Author: asutton
Date: 2010-06-22 09:11:03 EDT (Tue, 22 Jun 2010)
New Revision: 63227
URL: http://svn.boost.org/trac/boost/changeset/63227

Log:
Fixed some missing name changes in the documentation.

Text files modified: 
   trunk/libs/graph/doc/boykov_kolmogorov_max_flow.html |     5 +++--                                   
   1 files changed, 3 insertions(+), 2 deletions(-)

Modified: trunk/libs/graph/doc/boykov_kolmogorov_max_flow.html
==============================================================================
--- trunk/libs/graph/doc/boykov_kolmogorov_max_flow.html	(original)
+++ trunk/libs/graph/doc/boykov_kolmogorov_max_flow.html	2010-06-22 09:11:03 EDT (Tue, 22 Jun 2010)
@@ -114,7 +114,8 @@
 the minimum capacity is added to the residual capacity of the reverse edges. If
 no more paths in the residual-edge tree are found, the algorithm terminates.
 Instead of finding a new shortest path from source to sink in the graph in each
-iteration, Kolmogorov's version keeps the already found paths as follows:</P>
+iteration, the Boykov-Kolmogorov algorithm keeps the already found paths as
+follows:</P>
 
 <P>The algorithm builds up two search trees, a source-tree and a
 sink-tree. Each vertex has a label (stored in <I>ColorMap</I>) to
@@ -196,7 +197,7 @@
         each vertex has a source and sink connect. During this step, all
         vertices that have an unsaturated connection from source are added
         to the active vertex list and so the source is not.</LI>
-	<LI>active vertices: Kolmogorov uses two lists for active nodes
+	<LI>active vertices: Boykov-Kolmogorov uses two lists for active nodes
         and states that new active vertices are added to the rear of the
         second. Fetching an active vertex is done from the beginning of the
         first list. If the first list is empty, it is exchanged by the