Counting Triangles in Graphs

Given two graphs – a directed graph DIR_GRAPH and an undirected graph UNDIR_GRAPH – you are tasked with counting the number of triangles in each of the graphs.

Example:

In the example graphs provided, both directed and undirected graphs have two triangles:

Directed Graph Triangles: (0, 3, 2) and (0, 1, 2)

Undirected Graph Triangles: (0, 3, 2) and (0, 1, 2)

Input:

The first line contains an integer ‘T’ denoting the number of test cases.
For each test case:
- The next line contains two space-separated integers, ‘V1’ and ‘E1’, representing vertices and edges in ‘DIR_GRAPH’ respectively.
- Next ‘E1’ lines contain two space-separated integers representing an edge between vertices a1 and b1.
- Followed by a line with two space-separated integers, ‘V2’ and ‘E2’, representing vertices and edges in ‘UNDIR_GRAPH’ respectively.
- Next ‘E2’ lines contain two space-separated integers denoting an edge between vertices a2 and b2.

Output:

For each test case, print two integers representing the number of triangles in ‘DIR_GRAPH’ and ‘UNDIR_GRAPH’ respectively, on a new line.

Constraints:

• 1 ≤ T ≤ 100
• 2 ≤ V1, V2 ≤ 1000
• 1 ≤ E1 ≤ (V1 * (V1 - 1)) / 2
• 1 ≤ E2 ≤ (V2 * (V2 - 1)) / 2
• 0 ≤ a1, b1 ≤ V1 - 1
• 0 ≤ a2, b2 ≤ V2 - 1
• Time Limit: 1 sec

Note:

You do not need to manually print the results. Implement the function to return the results.