|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r65963 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2010-10-14 14:58:01
Author: jewillco
Date: 2010-10-14 14:58:00 EDT (Thu, 14 Oct 2010)
New Revision: 65963
URL: http://svn.boost.org/trac/boost/changeset/65963
Log:
Fixed documentation of distance map; fixes #4737
Text files modified:
trunk/libs/graph/doc/prim_minimum_spanning_tree.html | 9 ++++-----
1 files changed, 4 insertions(+), 5 deletions(-)
Modified: trunk/libs/graph/doc/prim_minimum_spanning_tree.html
==============================================================================
--- trunk/libs/graph/doc/prim_minimum_spanning_tree.html (original)
+++ trunk/libs/graph/doc/prim_minimum_spanning_tree.html 2010-10-14 14:58:00 EDT (Thu, 14 Oct 2010)
@@ -197,11 +197,10 @@
UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
<blockquote>
- The shortest path weight from the source vertex <tt>s</tt> to each
- vertex in the graph <tt>g</tt> is recorded in this property map. The
- shortest path weight is the sum of the edge weights along the
- shortest path. The type <tt>DistanceMap</tt> must be a model of
- <a
+ The weight of the spanning tree edge into each
+ vertex in the graph <tt>g</tt> is recorded in this property map, with edges
+ directed away from the spanning tree root.
+ The type <tt>DistanceMap</tt> must be a model of <a
href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
Property Map</a>. The vertex descriptor type of the
graph needs to be usable as the key type of the distance map. The
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk