Challenge: Implement breadth-first search

Learn to implement the breadth-first search algorithm by completing the doBFS() function. Understand how to track distances and predecessors for each vertex to map shortest paths from a source in graph traversal.