Tarjan's strongly connected components algorithm
Graph algorithm
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm. The algorithm is named for its inventor, Robert Tarjan.
Read on Wikipedia · Image LynX, CC BY-SA 3.0
Open boosters, collect cards and trade them. Free to play.
Play for free