LeetCode 785 Is Graph Bipartite? - Algorithm

Here is the full algorithm:

$1.$ Create color array of size $n$, all initialized to $-1$.

$2.$ For each node $i$ from $0$ to $n-1$: if color[i] == -1, start BFS from $i$.

$3.$ In BFS: color start node $0$, add to queue.

While queue not empty: pop node, check all neighbors. If neighbor uncolored, give opposite color, add to queue. If neighbor has same color, return false.

$4.$ If all BFS complete without conflict, return true.

This runs in $O(V + E)$ time and uses $O(V)$ space.