Re: [Boost-bugs] [Boost C++ Libraries] #375: LEDA graph adaptors do not handle hidden nodes properly

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #375: LEDA graph adaptors do not handle hidden nodes properly
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2008-04-29 18:25:37

#375: LEDA graph adaptors do not handle hidden nodes properly
----------------------+-----------------------------------------------------
  Reporter:  dgregor  |       Owner:  dgregor
      Type:  Bugs     |      Status:  new    
 Milestone:           |   Component:  graph  
   Version:  None     |    Severity:  Problem
Resolution:  None     |    Keywords:         
----------------------+-----------------------------------------------------
Changes (by dgregor):

  * owner:  doug_gregor => dgregor

Old description:

> {{{
> Hidden nodes are completely ignored by the LEDA graph adaptors.
> This may cause problems when, for instance, there are hidden
> nodes but the equivalent of vertex_index is used to construct a
> (BGL) property map. The LEDA adaptors should probably take the
> same approach as filtered_graph: let num_vertices() return the
> number of the nodes in the graph plus the number of hidden nodes,
> but vertices() filters out the hidden nodes. Similarly for edges.
> }}}

New description:

 {{{
 Hidden nodes are completely ignored by the LEDA graph adaptors.
 This may cause problems when, for instance, there are hidden
 nodes but the equivalent of vertex_index is used to construct a
 (BGL) property map. The LEDA adaptors should probably take the
 same approach as filtered_graph: let num_vertices() return the
 number of the nodes in the graph plus the number of hidden nodes,
 but vertices() filters out the hidden nodes. Similarly for edges.
 }}}

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