Bipartite Graph Problem Statement

Given an undirected graph of 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, the task is to determine whether the graph is bipartite.

Explanation:

A bipartite graph is one where the vertex set can be divided into two sets such that each edge connects a vertex from one set to a vertex in the other set. Alternatively, a bipartite graph can be colored using two colors such that no two adjacent vertices share the same color.

Input:

The first line of input contains an integer ‘T’ denoting the number of test cases. The first line of each test case contains two integers ‘V’ and ‘E’ representing the number of vertices and the number of edges in the graph, respectively. The next E lines contain two space-separated integers ‘u’ and ‘v’ indicating an edge between vertex u and vertex v.

Output:

For each test case, return “True” if the graph is bipartite; otherwise, return “False”. Each test case's output is printed on a new line.

Example:

Input: 4 4 0 1 0 2 1 3 2 3 Output: True Explanation: The graph can be colored using two colors, with no adjacent vertices sharing the same color, thus making it bipartite.

Constraints:

• The graph has no parallel edges; no two vertices are directly connected by more than one edge.
• The graph is undirected.
• 1 ≤ T ≤ 10
• 2 ≤ V ≤ 200
• 1 ≤ E ≤ V * (V - 1) / 2

Note:

You are not required to print the output explicitly. Implement the function to check bipartiteness.