DFS-Visit

In a book that i thought i would never pick up again, Cormen - Leiserson - Rivest, there's a nice graph algorithm called 'DFS-Visit' that i implemented in C.
it's very convenient for traversing a graph and picking out the cross, forward, and back edges.
(Although cross/forward edges very depending on the edge traversal order!)