Date: 2001-02-01 21:35:01
--- In boost_at_y..., Jeremy Siek <jsiek_at_l...> wrote:
> I'm guessing, but perhaps you are looking for some kind of guarantee
> like the following for undirected graphs:
> for (tie(ui, ui_end) = out_edges(u, g); ui != ui_end; ++ui)
> assert(source(*ui, g) == u);
Yes, that's what I mean. Sorry for not writing concisely.
> This certainly should be made explicit.
So, what is the current status? Is the above property of out_edges
already a requirement (though undocumented) of BGL? Or is it just
a coincidence that the current implementations in BGL assume the
> I know most of the BGL graph
> algorithms assume the above to be true for both directed and
> undirected graphs.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk