Bridge in Graph Problem Statement

Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of connected components in the graph, effectively causing a disconnection.

Example:

Input:

If the given graph is represented as:
Edges = [(0, 1), (1, 2), (2, 3), (0, 4)]

Output:

Edge (0, 4)

Explanation:

The edge between 0 and 4 is a bridge because its removal disconnects the graph, increasing the number of components.

Constraints:

• No self-loops are present in the graph.
• No parallel edges exist; no two vertices are connected by more than one direct edge.

Input:

The input consists of multiple test cases formatted as follows:

The first line contains an integer T, the number of test cases.
Each test case starts with a line containing two space-separated integers V and E.
The next E lines of each test case describe the edges, with each line containing two space-separated integers a and b, denoting an edge between vertices a and b.

Output:

For each test case:
The first line should contain a single integer C, the count of bridges in the graph.
The following C lines should each contain the two vertices defining an edge that is a bridge, sorted in non-decreasing order.

Note:

You don't need to handle input/output operations or sorting, as these are managed. Implement the function to find the bridges.

Constraints:

• 1 <= T <= 50
• 1 <= V <= 10^3
• V-1 <= E <= 3 * 10^3
• 0 <= a, b < V
• Time Limit: 1 sec