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-08-05 08:01:27

#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 Li.Long@…):

 Replying to [comment:6 jewillco]:
 > How do you get two separate spanning trees?  How do the vertices and
 edges relate between them?  Does either cover the entire input graph?

 The two separate spanning trees do cover the entire input graph, but they
 cover different edges of the "correct" spanning tree.  If you run the
 examples, it's pretty easy to see.  The example input tree contains only 6
 nodes, small enough to eye-ball it.

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