Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4408 |

@sanjay05 | 3762 |

@mantu_singh | 3666 |

@gfgaccount | 3605 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 953 |

@kanewilliamson123 | 894 |

@pradeeppatidar1999 | 868 |

@akhileshkumar562002 | 862 |

@wallflowe101 | 822 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@nikhilkushwah280 | 796 |

Complete Leaderboard |

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.

**Example 1:**

Input:Output:3Explanation: We can clearly see that there are 3 Strongly Connected Components in the Graph

**Example 2:**

Input:Output:1Explanation: All of the nodes are connected to each other. So, there's only one SCC.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **kosaraju()** which takes the number of vertices V and adjacency list of the graph as inputs and returns an integer denoting the number of strongly connected components in the given graph.

**Expected Time Complexity:** O(V+E).

**Expected Auxiliary Space:** O(V).

**Constraints:**

1 ≤ V ≤ 5000

0 ≤ E ≤ (V*(V-1))

0 ≤ u, v ≤ N-1

Sum of E over all testcases will not exceed 25*10^{6}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Strongly Connected Components (Kosaraju's Algo)

...