352 B
352 B
Outline
To make our knowledge of graphs useful, we'll go over our first traversal method today: depth-first search. We will also go over breadth-first search, and how both algorithms can be useful.
Assignment: finish the code for depth-first search, and also implement breadth-first search.