Tarjei Knapstad wrote: >> > > > d-e-f >> > > > / >> > > > a-b-c >> > > > \ >> > > > g-h-i >> > > > >> > > > Starting vertex is 'c' and I want to eliminate the "d-e-f" branch, >> > > > so the DFS finds "c-b-a" and "c-g-h-i". >> >> AFAICS, 'd' is not an adjacent vertex of 'c'. >> > Why? There's and edge (c,d), so certainly 'd' is adjacent to 'c' (this > is to my knowledge the definition of "adjacent vertex").
I suspect that vladimir josef sykora did not use fixed-width-fonts when viewving your message ;-) With variable-width fonts, there's (b,e) edge. >> There's the _visit_ version of the algorithm, where this task is left to >> the user. So you could color your graph as you like, and then call that >> version. >> > >>From Vladimir Prus: >> Just to clarify: are you talking about "undirected_depth_first_visit" >> function as found in <boost/graph/undirected_dfs.hpp>? > > This is of course exactly what I'm after, but I hand't seen it until now > because it's not mentioned in the docs and it's stashed at the bottom of > that header where I obviously hadn't looked Well, docs problems... I'm sure that if you document the function somebody will commit it ;-) - Volodya _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
