[boost] Re: Bug? adjacency_list: edge takes linear not logarithmic time

From: Alan Stokes (alan_at_[hidden])
Date: 2004-01-22 06:16:58

Jeremy Siek wrote:
> I instead changed the function called by g_.remove_edge(e). The
> reason is that e can be an edge or an iterator, so we have to
> dispatch first, then apply source/target.

Yes, just after posting I realised I hadn't fully comprehended what that 
function was doing. FWIW your fix looks good to me.

Did you get a chance to look at my other issue, with edge(u, v, g) taking linear 
  time? It's mentioned in the first post in this thread (message 31695).

Cheers,

Alan