Biblio
Get flash to fully experience Pearltrees
Tarjan's Algorithm (named for its discoverer, Robert Tarjan [ 1 ] ) is a graph theory algorithm for finding the strongly connected components of a graph . Although it precedes it chronologically, it can be seen as an improved version of Kosaraju's algorithm , and is comparable in efficiency to the path-based strong component algorithm . [ edit ] Overview