Many graph algorithms require processing vertices or edges of a graph in systematic fashion. There are two principal for doing such traversals: Depth-First Search (DFS) and Breadth-First Search (BFS). This very brief paper compares the two algorithms. It outlines the differences and the similarities between the two.