Breadth-First Search Here is the algorithm from the text for breadth-first search BFS(G, s) for each vertex uEG.V-s u.color WHITE 4 s.color GRAY s, ? = NIL 0 9.Enqueue(Q, s) 10, while Q u - Dequeue(Q) for each vEG.Ai[u] 12 13 14 15 16 17 18 if v.color WHITE v.color- GRAY Enqueue(Q,v) u.color - BLACK