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:16:10

#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 jewillco):

 You appear to be getting the spanning tree from the parent map, which is
 the correct way to do it.  How can a single vertex appear in more than one
 tree since it only has one parent?

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