Hi, I'm currently trying to implement an algorithm that basically is a DFS. The description looks roughly like this: Start a DFS, when going down an edge (e.g. put it into the tree): do something when backtracking an edge (e.g. move upwards in the search tree): do something else I tried to implement this using the DFS Visitor concept. However it seems like the appropriate events are not defined in this concept. Am I missing something here? Is it possible to reuse depth_first_search here? Or should I just I go ahead and implement my own DFS? Thanks, Ignaz