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

Kosaraju Algorithm | Strongly connected components in a graph

This video explains the Kosaraju algorithm which is used to find all the strongly connected components in a graph.We can even use this algorithm to find if the given graph is strongly connected or not.I have shown the concepts of strongly connected components in the beginning of the video and then explained some properties of graph which we can use to find the strongly connected components.I have explained the kosaraju algorithm using simple DFS and stack.This is a 3 step process.The first step is to traverse the graph using DFS and then push the nodes in stack.The second step is to find transpose of the graph, that is, reverse all the edges in the graph.The third step is to pop nodes one by one from stack and make DFS calls to find the nodes in a strongly connected component.I have also shown why the kosaraju algorithm logic works using the transpose graph logic.At the end of the video, I have explained the code walk through.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :) ======================================================================== Join this channel to appreciate our effort /\ and to get access to perks:    / @techdose4u   INSTAGRAM :   / surya.pratap.k   SUPPORT OUR WORK:   / techdose   LinkedIn:   / surya-pratap-kahar-47bb01168   WEBSITE: https://techdose.co.in/ TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5... ======================================================================= CODE LINK: https://gist.github.com/SuryaPratapK/... USEFUL VIDEOS:- Prims Algorithm:    • Prims algorithm | MST | Code implementation   Kruskals Algorithm:    • Kruskals algorithm | Construct MST