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-07-10 15:02:49

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

  * owner:  => asutton
  * component:  None => graph

Comment:

 Are you using an actual undirected graph (one with undirectedS), or a
 directed graph with each edge put in twice?  If the latter, the algorithm
 will consider the edges to be completely separate and may not handle that
 properly.  The documentation does not explicitly say what happens with
 parallel edges, so that might need to be fixed.

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