Opening activity: As a group, draw a big, complicated graph (it can be acyclic, cyclic, directed, undirected, etc), with at least 10 nodes. I would make it connected for convenience's sake.

• Discuss as a group what a DFS and a BFS traversal would look like (these are not unique solutions). Write the traversals you decided on as a group.

• Divide and Conquer - some example problems for "fun"