Hi Cosimo, Cosimo Calabrese wrote:
Hi to all,
I'm studying the BGL, and I've a question. I've noticed that:
- the traversing algorithms, like breadth first search, only decide how to traverse the graph, but do not perform specific calculations; - if I want to perform any calculation during the traverse, I can do it passing a custom visitor to the algorithm.
But the question is: how can I customize the traverse method? The algorithms always explore enterely the graph.
[example]
The solution I found is to modify the breadth_first_search algorithm, adding a predicate to the visitor and performing a control when the algorithm examines the outer edges of the current vertex. Something like this:
[A possible solution]
Does it exist a better mechanism to control the traverse with the BGL? Or I must implement my solution?
Best Regards, Cosimo Calabrese.
You also may try to use filtered graph adaptor http://www.boost.org/doc/libs/1_39_0/libs/graph/doc/filtered_graph.html Regards, Dmitry