Strongly Connected Components (Tarjan’s Algorithm) Problem Statement

Given an unweighted directed graph with V vertices and E edges, your task is to identify and print all the strongly connected components (SCCs) within the graph.

Input:

The first line of input contains an integer 'T' denoting the number of test cases. 
For each test case, the first line contains two space-separated integers 'V' and 'E', representing the number of vertices and edges in the graph. 
The following 'E' lines each contain two space-separated integers 'a' and 'b', indicating a directed edge from vertex 'a' to 'b'.

Output:

For each test case, print the vertices included in each strongly connected component as space-separated values on a single line per SCC. 
The order of SCCs or the order of vertices within an SCC does not matter.

Example:

Input:

T = 1
V = 4, E = 5
Edges = [(0, 1), (1, 2), (2, 0), (1, 3), (3, 1)]

Output:

[0, 1, 2]
[3]

Constraints:

• 1 ≤ T ≤ 300
• 1 ≤ V ≤ 2000
• V - 1 ≤ E ≤ 2000
• 0 ≤ a, b < V

Note:

Zero-based indexing is used for vertices. You do not need to output the results; the function handles it internally.