[Boost-users] [Graph] Lazy BFS

Hi, I'm looking to traverse a DAG using BFS where vertices are discovered after the last incident edge has been examined. That is, I want to discover vertices lazily rather than the current BFS behavior of discovering vertices eagerly (following the first incident edge). I know I can modify the BFS algorithm to effect this behavior but I'm wondering if anyone has figured out the visitor changes necessary to support this? Thanks. -- Noel