Back to Browse

Strongly Connected Components | Kosaraju algorithm | Graphs | GFG | DSA | Java | hindi

1.7K views
Sep 17, 2024
19:06

Lecture Resources https://github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course/tree/main/Lecture-237%20-%20Koraraju%20Algorithm Problem Name: Strongly Connected Components (Kosaraju's Algo) Problem Statement: 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. Problem Link: https://www.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1 Graph Playlist: https://www.youtube.com/playlist?list=PLQ7ZAf76c0ZOGuMjg3qwNgILb_dKWTxyQ Samsung Interview Experience: https://youtu.be/GrvlpBzphSU Company Tags: Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung Timestamp: 0:00 - Introduction #ShashwatTiwari #coding​​ #problemsolving​

Download

0 formats

No download links available.

Strongly Connected Components | Kosaraju algorithm | Graphs | GFG | DSA | Java | hindi | NatokHD