Closed Kumar-laxmi closed 2 months ago
@Kumar-laxmi kindly assign this to me under SSOC'23
@Kumar-laxmi please assign this to me under SSOC'23. I'm ready to contribute in all 4 languages
@Kumar-laxmi I would like to work on this issue could you please assign it to me. Thank you!
@Kumar-laxmi I would like to work on this issue. Please assign it to me under SSoC'23
@Kumar-laxmi I would like to work on this under ssoc'23, Have also implemented it quite a few times. Haven't yet contributed to the algorithms repository this season.
Assigned! @shanvijha30 : C, Java & Python
Stale issue message
Feature = Kosaraju Algorithm
Kosaraju's algorithm is a graph algorithm used to find strongly connected components (SCCs) in a directed graph. A strongly connected component is a subset of vertices in a graph where there is a path between any two vertices within the subset. The algorithm addresses the problem of identifying these strongly connected components.
Approach :
Kosaraju's algorithm utilizes depth-first search (DFS) and a two-pass approach to find strongly connected components in a directed graph. It performs the following steps:
1 First Pass (DFS):
Graph Transposition:
Second Pass (DFS on Transposed Graph):
Additional context![image](https://github.com/Kumar-laxmi/Algorithms/assets/76027425/2053b8e7-1ec1-4f40-a42e-da8ccece6a49)