[Boost-users] Selective depth-first search in a graph

From: Anatoli Sakhnik (sakhnik_at_[hidden])
Date: 2006-04-10 11:58:13

Hello, boost users!
Is there a simple way to perform a selective depth-first search in a
graph, so that I could choose edges to traverse the graph? For
example, let's assume I can walk through an edge, only if its weight
is greater than 0. How could I reveal all reachable vertices?
It worth pointing out that the real availability condition is a little
bit more complicated, but easity can be revealed from edge's inner
properties.
Thank you in advance!
-- Anatoli Sakhnik