From: jeremy siek (jsiek_at_[hidden])
Date: 2000-09-27 16:03:31
Ok, both versions of remove_edge() have been added.
(despite VC++'s half hearted attempt to foil this with a
bug in their function overloading/template mechanism)
David Abrahams writes:
> Directed graphs are common. I guess that if you have a high out-degree, it
> really is worth it.
> ----- Original Message -----
> From: "jeremy siek" <jsiek_at_[hidden]>
> To: <boost_at_[hidden]>
> Sent: Wednesday, September 27, 2000 1:27 PM
> Subject: Re: [boost] Graph: remove_edge(g, e)
> > David Abrahams writes:
> > > Still, it wouldn't hurt to retain the other interface for efficiency,
> > > it?
> > The iterator version would be much more efficient in the directed
> > case, but only slightly more efficient for bidirectional and
> > undirected. Do you think it is worth it?
> > Cheers,
> > Jeremy
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk