Subject: Re: [boost] Bug in boost graph library
From: Arne Schwabe (arne_at_[hidden])
Date: 2010-07-17 09:32:10
On 16.07.2010 23:26, Andrew Sutton wrote:
>> Would it be appropriate to return a filter iterator for non-associative
>> That would produce the right semantics, but I'm not sure it satisfies the
>> performance requirements (since stepping the filter_iterator can take
>> arbitrarily long). We can certainly do it, though. Do you think it's good
>> to put in?
> Not really. I'm not sure there are that many people actually using the
> functionality. If somebody really wants it, we could provide it.
I tried to use it. :) But since the count of my edges are rather small
per node (something <= 10) I can iterate over the out_edges() list
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk