boost_mirror/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2025-05-11 13:24:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added note about parallel edges to docs

Browse Source 
[SVN r57914]
This commit is contained in:
Jeremiah Willcock 2009-11-24 22:34:25 +00:00
parent fa50529664
commit e47d3c4c5a
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
doc/prim_minimum_spanning_tree.html
View File

@ -55,6 +55,8 @@ simply a call to <a
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 @@ IN: <tt>const Graph&amp; g</tt>
<blockquote>
An undirected graph. The type <tt>Graph</tt> must be a
model of <a href="./VertexListGraph.html">Vertex List Graph</a>
and <a href="./IncidenceGraph.html">Incidence Graph</a>.<br>
and <a href="./IncidenceGraph.html">Incidence Graph</a>. It should not
contain parallel edges.<br>
<b>Python</b>: The parameter is named <tt>graph</tt>.
</blockquote>