|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r57914 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2009-11-24 17:34:25
Author: jewillco
Date: 2009-11-24 17:34:25 EST (Tue, 24 Nov 2009)
New Revision: 57914
URL: http://svn.boost.org/trac/boost/changeset/57914
Log:
Added note about parallel edges to docs
Text files modified:
trunk/libs/graph/doc/prim_minimum_spanning_tree.html | 5 ++++-
1 files changed, 4 insertions(+), 1 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 2009-11-24 17:34:25 EST (Tue, 24 Nov 2009)
@@ -55,6 +55,8 @@
href="./dijkstra_shortest_paths.html"><TT>dijkstra_shortest_paths()</TT></a>
with the appropriate choice of comparison and combine functors.
The pseudo-code for Prim's algorithm is listed below.
+The algorithm as implemented in Boost.Graph does not produce correct results on
+graphs with parallel edges.
</p>
<table>
@@ -131,7 +133,8 @@
<blockquote>
An undirected graph. The type <tt>Graph</tt> must be a
model of Vertex List Graph
- and Incidence Graph.<br>
+ and Incidence Graph. It should not
+ contain parallel edges.<br>
<b>Python</b>: The parameter is named <tt>graph</tt>.
</blockquote>
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