BGL: traversal algorithm for tree

I have implemented a rooted tree structure as a BGL graph. I need to be able to traverse the tree from root to leaves, while doing something at each vertex. I need to be able to do this as inorder and postorder traversal. My question is if it's possible to do this with any of the existing algorithms in BGL. My current thinking is to implement a function traversal( ... ), but if there already exists an alternative, I would prefer to use it. Björn