Is Graph Bipartite

easy
Question Solve Solutions 
1. You are given a graph.
2. You are required to find and print if the graph is bipartite

Note -> A graph is called bipartite if it is possible to split it's vertices in two sets of mutually 
               exclusive and exhaustive vertices such that all edges are across sets.

Input Format

Input has been managed for you

Output Format

true if the graph is bipartite, false otherwise

Constraints

None

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
7
8
0 1 10
1 2 10
2 3 10
0 3 10
3 4 10
4 5 10
5 6 10
4 6 10
Output
false
Previous
Is Graph Cyclic
Next
Breadth First Traversal

Related Questions

easy Knights Tour easy Has Path? easy Print All Paths easy Multisolver - Smallest, Longest, Ceil, Floor, Kthlargest Path easy Get Connected Components Of A Graph easy Is Graph Connected easy Number Of Islands easy Perfect Friends easy Hamiltonian Path And Cycle easy Is Graph Cyclic easy Breadth First Traversal easy Spread Of Infection easy Shortest Path In Weights easy Minimum Wire Required To Connect All Pcs easy Order Of Compilation easy Iterative Depth First Traversal