Write a program to find the strongly connected components in a directed graph using Tarjan's algorithm.
HardProblem Statement
Write a program to find the strongly connected components in a directed graph using Tarjan's algorithm.
Sample Input
Graph: Provided in the problem description.
Sample Output
Strongly Connected Components: 2 1 0 5 4 3
Limits
Time: 2s · Memory: 256 MB
Code Editor
00:00
using System;
class StronglyConnectedComponents
{
static void Main()
{
// Find strongly connected components in a directed graph
}
}
Input
Graph: Provided in the problem description.
Expected Output
Strongly Connected Components: 2 1 0 5 4 3