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

Subject: [Boost-commit] svn:boost r66960 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2010-12-01 15:15:46

Author: jewillco
Date: 2010-12-01 15:15:41 EST (Wed, 01 Dec 2010)
New Revision: 66960
URL: http://svn.boost.org/trac/boost/changeset/66960

Log:
Fixed complexity of Dijkstra's algorithm; fixes #4852
Text files modified: 
   trunk/libs/graph/doc/dijkstra_shortest_paths.html              |     2 +-                                      
   trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html |     2 +-                                      
   2 files changed, 2 insertions(+), 2 deletions(-)

Modified: trunk/libs/graph/doc/dijkstra_shortest_paths.html
==============================================================================
--- trunk/libs/graph/doc/dijkstra_shortest_paths.html	(original)
+++ trunk/libs/graph/doc/dijkstra_shortest_paths.html	2010-12-01 15:15:41 EST (Wed, 01 Dec 2010)
@@ -390,7 +390,7 @@
 <H3>Complexity</H3>
 
 <P>
-The time complexity is <i>O(V log V)</i>.
+The time complexity is <i>O(V log V + E)</i>.
 
 
 <h3>Visitor Event Points</h3>

Modified: trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html
==============================================================================
--- trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html	(original)
+++ trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html	2010-12-01 15:15:41 EST (Wed, 01 Dec 2010)
@@ -322,7 +322,7 @@
 <H3>Complexity</H3>
 
 <P>
-The time complexity is <i>O(V log V)</i>.
+The time complexity is <i>O(V log V + E)</i>.
 
 
 <h3>Visitor Event Points</h3>