Tarjan's Algorithm
There's a total of 1 articles.
Strongly Connected Components in Graph Theory
Strongly connected component of a directed graph is a subgraph in which there exists a path from every vertex to every other vertex in the subgraph.
In this article I implement Tarjan's algorithm to find strongly connected components in a graph.
