6.a) Kosaraju Algorithm || Strongly connected components скачать в хорошем качестве

6.a) Kosaraju Algorithm || Strongly connected components

In this video on graph data structure, I have discussed about kosaraju algorithm, which is used to find the number of strongly connected components in a graph. The algorithm used is divided into 2 parts. 1) We perform dfs i.e depth first search on graph, when it is done, we put that element in stack. 2) We reverse the graph, keep popping elements from the graph, when we get non-visited node, we perform dfs, and it gives 1 strongly connected component. Number of dfs calls are the number of strongly connected components. Practice questions: 1) Geeks for Geeks: https://practice.geeksforgeeks.org/pr... Graph playlist:    • Topics in graph data structure   Advanced tree concepts:    • 1. Morris traversal || Inorder traversal i...   Playlist on binary search tree (bst) data structure:   • 1) Binary Search tree Topics | Important t...   Playlist on binary tree data structure:    • Trees Data Structure - [Important topics i...   SDE Placement Strategy:    • SDE Placement Strategy || Interview Prepar...   Linkedin:   / kashish-mehndiratta   Instagram:   / kashish__mehndiratta1   I hope you liked my video, do subscribe to my channel to get the updates of my latest uploads. #graph #datastructure #algorithm #interviewquestions #placement #internship #faang