|
Boost Users : |
From: martin f krafft (madduck_at_[hidden])
Date: 2005-06-13 09:23:19
This may seem like a silly question, but how does one actually
search with DFS or BFS? Say I want to find the first node for which
a predicate returns true in a BFS traversal starting at node N...
The function signatures don't have a parameter for "criteria" or
"predicate", so I guess it's up for a Visitor to implement such
a check. What is not clear to me is how the visitor functions can
break out of the search once a condition is true.
Thanks,
-- martin; (greetings from the heart of the sun.) \____ echo mailto: !#^."<*>"|tr "<*> mailto:" net_at_madduck invalid/expired pgp subkeys? use subkeys.pgp.net as keyserver! spamtraps: madduck.bogus_at_[hidden] "information superhighway" is just an anagram for "i'm on a huge wispy rhino fart".
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net