Hi,
I don't think there's a formal and well estabilished 'definition' of
whether or not adjacent vertices might contain duplicates.
On 10/10/06, moritz Hilger
hi, as far as i can tell the adjacent_vertices function in adjacency list (as well as the inv_adjacent_vertices counterpart) simply wraps around the out_edge (in_edge) function. this differs from what i would expect from a function returning adjacent vertices, since in my notion a set of adjacent vertices shouldn't contain duplicate entries, which the current implementation does have when used with parallel edges. any good reason for that (or does my definition of adjacent vertices differ from everybody else's)? greetings moritz
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
-- Leandro Terra C. Melo