Lecture Notes on 27 Feb 2017

Read Chapter 3.6 Lists

Breadth First Search

0. Start at a given vertex. Mark it current and visited.

1. Visit the next unvisited vertex (if there is one) that is adjacent to
   current vertex and mark it visited and insert it into the queue.

2. If there are no adjacent unvisited vertex, remove a vertex from the
   queue and make it the current vertex. Repeat Step 1.

3. If there are no adjacent unvisited vertex and the queue is empty then
   you are done.