Tarjan's algorithm

Today it means: An algorithm for finding the strongly connected components (SCCs) of a directed (connected) graph by using the depth-first search function. Full definition →