The goal of a graph traversal, generally, is to find all nodes reachable from a given set of root nodes. In an undirected graph we follow all edges; in a directed graph we follow only out-edges.
This project includes
- depth-first search
- cycle detection
- topological sort
- identifying strongly connected components