Subject: [Boost-commit] svn:boost r65939 - trunk/libs/graph/doc
From: asutton_at_[hidden]
Date: 2010-10-13 09:47:24
Author: asutton
Date: 2010-10-13 09:47:23 EDT (Wed, 13 Oct 2010)
New Revision: 65939
URL: http://svn.boost.org/trac/boost/changeset/65939
Log:
Clarifying references to MST in Dijkstra's SP algorithm.
Text files modified:
trunk/libs/graph/doc/dijkstra_shortest_paths.html | 7 ++++---
1 files changed, 4 insertions(+), 3 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-10-13 09:47:23 EDT (Wed, 13 Oct 2010)
@@ -248,9 +248,10 @@
OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
<blockquote>
- The predecessor map records the edges in the minimum spanning
- tree. Upon completion of the algorithm, the edges <i>(p[u],u)</i>
- for all <i>u in V</i> are in the minimum spanning tree. If <i>p[u] =
+ The predecessor map records the edges in the search tree, the tree computed
+ by the traversal of the graph. Upon completion of the algorithm, the edges
+ <i>(p[u],u)</i> for all <i>u in V</i> are in the search tree. The search
+ tree is not guaranteed to be a minimum spanning tree. If <i>p[u] =
u</i> then <i>u</i> is either the source vertex or a vertex that is
not reachable from the source. The <tt>PredecessorMap</tt> type
must be a <a