Directed graph reachability Given a directed graph G(V,E) and a node s, how do we determine what nodes are reachable from s? Do I need simple traversal algorithms or do I need to look at Tarjan's algorithm?
Use depth-first search, or breadth-first search, or any other graph search algorithm.  You don't need Tarjan's algorithm.