[Boost-users] Re: limiting searches in BGL

Hi Jason,

I am just starting to use the BGL, and have been beating my head upon a problem.  I am needing to find an irregularly bounded set of points in three dimensional space.  The points are within a convex hull and the graph edges are edges in a delaunay triangulation.  I want to start at a node known to be on the hull, and crawl through the inside with either depth first or breadth first search.  If you are on the hull, you would not allow the search to continue outside the hull.

I think you might want to use 'TerminatorFunc' argument to depth_first_visit. That's a functor which returns true if the search should not continue after a certain vertex. - Volodya