Strongly Connected Components
DFS · 38:45Kosaraju's Algorithm · Intuition · AMAZON · Graph Concepts & Qns- 38My notes
Sign in to keep private notes on every station, with video timestamps.
About this video
Video lecture "Strongly Connected Components" by codestorywithMIK, part of the Graphs chapter of the Data Structures & Algorithms course (38:45).
- Patterns
- DFS, Bridges/Articulation
- Chapter
- Graphs
- Duration
- 38:45
Related problems
- Graph Concepts & Qns - 4 (Microsoft, Amazon, Flipkart) : Detect Cycle in Undirected Graph using DFS
- Number of Provinces - (Google, Microsoft ) (LeetCode 547)
- Course Schedule (LeetCode 207)
- Course Schedule-II (LeetCode 210)
- Is Graph Bipartite ? (LeetCode 785)
- Hierholzer's Algorithm (LeetCode 2097)
- Diameter Of Undirected Graph (LeetCode 1245)
- Find Minimum Diameter After Merging Two Trees (LeetCode 3203)