This is the third in a series of videos about the graph data structure, including how to search a graph by systematically by visiting each and every vertex, namely, how to traverse a graph. Depth first traversal is compared with breadth first traversal, including explanations of how depth first traversal can make use of a stack data structure, and how breadth first traversal can make use of a queue data structure.