Boost logo

Boost Users :

Subject: Re: [Boost-users] BGL: interrupting breadth_first_search() at a certain distance/predicate?
From: Anders Wallin (anders.e.e.wallin_at_[hidden])
Date: 2010-08-03 13:30:05

my previous explanation of my application was maybe not the clearest,
so here is another try:

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 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.

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at