Boost logo

Boost Users :

From: Vladimir Prus (ghost_at_[hidden])
Date: 2004-06-16 03:52:31

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

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