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.
The examples in the Boost User Guide about the visitor concept are
sometimes not so easy to understand.
...
using namespace boost;
template <typename VertexNameMap>
class bfs_name_printer:public default_bfs_visitor {
public:
bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map){}
template