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:11:30

#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:                      |  
--------------------------------+-------------------------------------------

Comment(by anonymous):

 Replying to [comment:1 jewillco]:
 > 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.

 In the example in the attached .cpp, it's "undirectedS", when listing
 edges and their weights, it doesn't handle it well if you have both "(a,
 b)" and "(b, a)".  In these cases, is it smart enough to check if the
 given info are "consistant" and keep only one copy?

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