Error
|
|
---|---|
@Ibrahim Nash | 6379 |
@blackshadows | 6329 |
@mb1973 | 5358 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3357 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@ritiksethi21 | 1050 |
@aroranayan999 | 807 |
@RizulBansal | 685 |
@ashishtrehan002 | 538 |
@hemantgarg923 | 528 |
@simrangoyal | 526 |
@ronaldo77 | 520 |
@anishrajan | 505 |
@thanosagain | 505 |
@ssparteek470 | 495 |
@rahul2312 | 491 |
Complete Leaderboard |
Given a Directed Graph with V vertices and E edges, Find the members of strongly connected components in the graph.
Example 1:
Input:Output: 0 1 2,3,4, Explanation:
We can clearly see that there are 3 Strongly Connected Components in the Graph as mentioned in the Output.
Example 2:
Input:Output: 0 1 2, Explanation: All of the nodes are connected to each other. So, there's only one SCC as shown.
Your Task:
You don't need to read input or print anything. Your task is to complete the function tarjans() which takes the number of vertices V and adjacency list of the graph as input parameters and returns a list of list of integers denoting the members of strongly connected components in the given graph.
Note: A single strongly connected component must be represented in the form of a list if integers sorted in the ascending order. The resulting list should consist of a list of all SCCs which must be sorted in a way such that a lexicographically smaller list of integers appears first.
Expected Time Complexity: O(V + E).
Expected Auxiliary Space: O(V).
Constraints:
1 ≤ V ≤ 105
1 ≤ E ≤ 105
0 ≤ u, v ≤ N-1
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes