Kosaraju's Algorithm
This page explains Kosaraju's Algorithm for finding the no of strongly connected component in a graph.
3 docs tagged with "Strongly Connected Components"
View all tagsTarjan's Algorithm
In this tutorial, we will learn about Tarjan's Algorithm and its implementation in Python, Java, C++, and JavaScript with detailed explanations and examples.
Tarjan’s Algorithm for Strongly Connected Components
This is a solution for implementing Tarjan’s Algorithm to find strongly connected components in a directed graph.