tree f3ab1441636a8bd3949b9cd587633cb1e68c4dd0
parent b4025e6c74a75b5d30f400a9740865e7e4a83ad1
author Andrew de los Reyes <adlr@chromium.org> 1268178978 -0800
committer Andrew de los Reyes <adlr@chromium.org> 1268178978 -0800

AU: Tarjan's algorithm.

Add an implementation of Tarjan's algorith for finding Strongly
Connected Components in a graph. This version is slightly modified: it
takes in a vertex in addition to the graph and returns only the SCC
containing that vertex.

Review URL: http://codereview.chromium.org/657055