Is Graph Bipartite
easy
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.
Constraints
None
Format
Input
Input has been managed for you
Output
true if the graph is bipartite, false otherwise
Example
Sample 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
Sample Output
false
Question Video