[boost] BGL bidirectional adjacancy_list problem

From: Hugo Duncan (hugoduncan_at_[hidden])
Date: 2004-10-21 20:22:15

We just updated to a recent cvs version of boost, and an algorithm that  
was taking three minutes
is now running for over an hour.  I think there are two problems, but am  
not at all sure of the
analysis:

The proximate cause seems to be the correction of the remove_edge function  
for bidirectional
adjacancy_list based graphs in around June.  Trying to see how to speed  
things up, I have run
into these problems

i) remove_edge is now O(E), due to the edge properties being stored on the  
graph rather than
    on a vertex.

ii) removing properties from the edges changes nothing, a container of  
no_property's is still
     maintained.

As I am not too familiar with the adjacancy_list implementation, can  
anyone confirm this?

Hugo