Lazy Traversal of Directed Graphs

The os.path.walk routine that ships with the Python standard library is limited to traversing the file system tree. A generic traversal for arbitrary (directed) graphs with support for recursion limits and other accumulated partial results seems useful.