This video is part of the Graph section under the GFG SDE Sheet.
In this video, we are given, a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, Find the number of strongly connected components in the graph.
Try it out before watching the implementation of the problem in the video. We recommend watching the video, even if you can solve the problem. You may discover something new. All the best!!!
Do check out:-
Article: https://www.geeksforgeeks.org/strongly-connected-components/
Problem: https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1
SDE Sheet Link: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/