|
Boost : |
From: David Abrahams (abrahams_at_[hidden])
Date: 2000-09-27 12:50:35
Directed graphs are common. I guess that if you have a high out-degree, it
really is worth it.
-Dave
----- 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,
would
> > 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