DescriptionAU: 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.
Patch Set 1 #
Total comments: 6
Patch Set 2 : fixes for review #
Messages
Total messages: 3 (0 generated)
|