Subject: [Boost-commit] svn:boost r85551 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2013-09-03 14:13:00
Author: jewillco
Date: 2013-09-03 14:12:59 EDT (Tue, 03 Sep 2013)
New Revision: 85551
URL: http://svn.boost.org/trac/boost/changeset/85551
Log:
Fixed pseudocode in documentation; fixes #9080
Text files modified:
trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html | 10 ++++++----
1 files changed, 6 insertions(+), 4 deletions(-)
Modified: trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html
==============================================================================
--- trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html Tue Sep 3 13:47:12 2013 (r85550)
+++ trunk/libs/graph/doc/dijkstra_shortest_paths_no_color_map.html 2013-09-03 14:12:59 EDT (Tue, 03 Sep 2013) (r85551)
@@ -124,11 +124,12 @@
<b>if</b> (<i>w(u,v) + d[u] < d[v]</i>)
<i>d[v] := w(u,v) + d[u]</i>
<i>p[v] := u</i>
- DECREASE-KEY(<i>Q</i>, <i>v</i>)
+ <b>if</b> (<i>d[v]</i> was originally infinity)
+ INSERT(<i>Q</i>, <i>v</i>)
+ <b>else</b>
+ DECREASE-KEY(<i>Q</i>, <i>v</i>)
<b>else</b>
...
- <b>if</b> (<i>d[v]</i> was originally infinity)
- INSERT(<i>Q</i>, <i>v</i>)
<b>end for</b>
<b>end while</b>
return (<i>d</i>, <i>p</i>)
@@ -146,10 +147,11 @@
edge <i>(u,v)</i> relaxed
+discover vertex <i>v</i>
+
edge <i>(u,v)</i> not relaxed
-discover vertex <i>v</i>
finish vertex <i>u</i>
</pre>
</td>