Graph traversals

We covered two important graph traversal algorithms: breadth-first search and depth-first search. We described depth-first search both recursively and iteratively.