You need to implement the BFS algorithm for the bipartiteness test problem. Please visit the nodes in numerical order. An O ( n + m ) - time algorithm is sufficient to pass any feasible test cases. Input You need to read the input from the console. In the first line of the input, we have two positive integers n and m. n is the number of vertices in the graph and m is the number of edges in the graph. The vertices are indexed from 1 to n. You can assume that 1 < = n < = 1 0 0 0 and 1 < = m < = 1 0 0 0 0 0. In the next m lines, each line contains 2 integers: u and v . This indicates that there is an edge { u, v } in the graph. The input graph may not be connected.