Tarjan's strongly connected components algorithm

Tarjan's Algorithm is an algorithm in graph theory for finding the strongly connected components of a graph. Although proposed earlier, it can be seen as an improved version of Kosaraju's algorithm, and is comparable in efficiency to the path-based strong component algorithm.

 circuit directed graph graph theory algorithm Robert Tarjan

Related links

  • PHP implementation of Tarjan's cycle detection algorithm
  • Return to the linkmark list.