Re: [Boost-bugs] [Boost C++ Libraries] #3257: boost/graph/prim_minimum_spanning_tree doesn't handle complete graph well

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #3257: boost/graph/prim_minimum_spanning_tree doesn't handle complete graph well
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2009-11-24 22:36:00

#3257: boost/graph/prim_minimum_spanning_tree doesn't handle complete graph well
---------------------------------+------------------------------------------
  Reporter:  Li.Long@…           |       Owner:  asutton
      Type:  Bugs                |      Status:  closed 
 Milestone:  Boost 1.40.0        |   Component:  graph  
   Version:  Boost 1.39.0        |    Severity:  Problem
Resolution:  wontfix             |    Keywords:         
---------------------------------+------------------------------------------
Changes (by jewillco):

  * status:  new => closed
  * resolution:  => wontfix

Comment:

 I get an output that has a cycle in the parent map.  Changing the graph to
 directedS (leaving in the duplicated edges) works fine.    I added a note
 to the documentation (in r57914) about parallel edges; I do not believe
 there is an easy way to fix it using the Boost.Graph implementation of
 Prim's algorithm, so I am closing the bug.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/3257#comment:8>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.