Re: [Boost-users] BGL: interrupting breadth_first_search() at a certain distance/predicate?

my previous explanation of my application was maybe not the clearest, so here is another try: http://tinyurl.com/3aoejnd looking at the BGL-documentation, would a planar_face_traversal of the outermost/innermost face of my graph traverse the edges/vertices in a useful order for producing the output I want? thanks, Anders

...

thanks for all replies, I will try writing an exception-throwing visitor or my own depth-limited bfs.

Really, that approach is likely to have very poor performance for your application.  You can use the exception approach once for a very large search, but if you use it repeatedly on very short searches, you won't like the result.  filtered_graph is your friend.