Bipartite Graph Problem

Check whether a given graph is bipartite or not. Return true if the graph's vertices can be divided into two independent sets, ‘U’ and ‘V’, such that every edge (‘u’, ‘v’) either connects a vertex from ‘U’ to ‘V’ or a vertex from ‘V’ to ‘U’.

You are provided with a 2D array edges consisting of 0s and 1s, where edges[i][j] = 1 indicates a bi-directional edge between vertices i and j. Edge existence implies both (i → j) and (j → i).

Input:

‘N’ = 3 ‘edges’ = [[0, 1, 1], [0, 0, 1], [0, 0, 0]] 

Output:

True or False (whether the graph is bipartite)

Example:

Given:

‘N’ = 3 ‘edges’ = [[0, 1, 1], [0, 0, 1], [0,0,0]]

Explanation:

The function should return whether the input graph is bipartite.

Constraints:

• 1 <= ‘T’ <= 10
• 2 <= ‘N’ <= 300
• 0 <= ‘edges[i][j]’ <= 1
• Time Limit: 1 second

Note:

Do not print the outcome, only implement the function to return the necessary result.