In this lesson, you have to implement the breadth first search algorithm. A solution is placed in the "solution" section to help you, but we suggest trying to solve it on your own first.
Problem statement
In this exercise, you have to implement the breadth first search traversal in Java. It is a level-by-level searching algorithm for the graph, so we are going to use our already-implemented graph class for this task (since we have already covered the implementation of graph).
Note: ...