Boost Users :
From: Doug Gregor (dgregor_at_[hidden])
Date: 2005-05-09 09:09:49
On May 9, 2005, at 5:54 AM, Rui Carvalho wrote:
> I have a directed graph (vecS, vecS, bidirectionalS) and I'm trying to
> iterate through the neighbour vertices of a vertex u. When using
> for (tie(ai0,ai0_end) = adjacent_vertices(u,g); ai0 != ai0_end; ++ai0)
> the code goes only through the out vertices of u. Is there a way to
> through all the neighbouring vertices in one loop (i.e. through both
> the out
> and in vertices of u)?
I don't know of a good way to do this with the BGL. You'll need to
either build some kind of smart iterator adaptor that traverses
out_edges then in_edges, or have two separate loops.
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