Boost Users :
From: Douglas Gregor (dgregor_at_[hidden])
Date: 2005-01-05 12:04:04
On Jan 5, 2005, at 11:26 AM, Matthias Linkenheil wrote:
> Dear all,
> i want to use the breadth_first_search algorithm to store the visited
> nodes e.g. in a list for access in the main function.
> Has anyone an idea to handle this?
> In my code i print out the visited nodes.
Create a list for the visited nodes (it will stored vertex_descriptors)
and store a reference or pointer to that list in your visitor. Finally,
instead of printing the vertex in the discover_vertex method of your
visit, do a push_back into your list.
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