[Boost-bugs] [Boost C++ Libraries] #6221: breadth_first_search calls tree_edge event point with wrapped edge when run on reverse_graph

Subject: [Boost-bugs] [Boost C++ Libraries] #6221: breadth_first_search calls tree_edge event point with wrapped edge when run on reverse_graph
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2011-12-06 00:45:30

#6221: breadth_first_search calls tree_edge event point with wrapped edge when run
on reverse_graph
---------------------------------+------------------------------------------
 Reporter:  pmachata@…           |       Owner:  jewillco
     Type:  Bugs                 |      Status:  new     
Milestone:  To Be Determined     |   Component:  graph   
  Version:  Boost 1.48.0         |    Severity:  Problem 
 Keywords:                       |  
---------------------------------+------------------------------------------
 Probably a fallout of changeset [73997].

 It seems one can get to the original edge by using the member "EdgeDesc
 underlying_desc".  But I'm not sure whether this is the intended
 interface.  The documentation of reverse_graph doesn't mention it.

 Besides, with "straight" graph, breadth_first_search calls tree_edge with
 unwrapped edge, so one can't reuse the same code for both cases.  (Or they
 have to invent accessor wrappers.)

 Could this somehow be remedied?  It doesn't seem intuitive to call
 tree_edge (and, presumably, others) with a wrapped edge instead of the
 edge itself.  And it is inelegant that this is different for reverse graph
 than for "straight" graph.

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