Graphs (Breadth-first traversal)

The nodes are traversed from left to right. (Reading time: under 2 minutes)

We'll cover the following...

Like always, we use a queue ...