|
Boost Users : |
From: Jeremy Siek (jeremy.siek_at_[hidden])
Date: 2006-04-25 11:39:18
Hi Sebastian,
On Apr 25, 2006, at 9:13 AM, Sebastian Weber wrote:
> Ok, once again, I'm the one overlooking some parts of the docs,
> shame on
> me! But another question: If I understand the implementation right, I
> can call base() on a filtered_graph-iterator to get an iterator of the
> base graph, right? This is just nice to know as this applies to all of
> the filtered graph iterators and can be very handy.
That's mostly true... not true of the adjacency_iterator.
This should be documented... I've added info about which
iterators are filter iterators.
Cheers,
Jeremy
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net