Bipartite Graph Check

Determine if a given graph is bipartite. A graph is considered bipartite if its vertices can be divided into two disjoint sets, 'U' and 'V', such that every edge connects a vertex in 'U' to one in 'V', or vice versa.

Your task is to return true if the graph can be divided in this manner.

Example:

Input:

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

Output:

true

Explanation: The vertices can be divided into two sets where set 'U' contains vertex 0, and set 'V' contains vertices 1 and 2. All edges connect vertices from different sets, making the graph bipartite.

Constraints:

• 1 <= T <= 10
• 2 <= N <= 300
• 0 <= edges[i][j] <= 1

Note:

If edges[i][j] = 1, it indicates a bi-directional edge exists between vertices i and j.