Breadth First Search (Algorithm)

$\text{BFS}(G)$:

1. Select root vertex and add to a Queue (ADT)
2. While queue is not empty:
   1. Inspect first element $u$ in queue
   2. Add unvisited neighbours of $u$ to queue
   3. Remove $u$ from queue