Graphs
•Breadth-First Search
–This starts at a specified vertex and visits every
vertex adjacent to that vertex before
embarking from any of those vertices to the
next set.
–It does not embark from any of these vertices adjacent
to the starting vertex until it has
visited all possible vertices adjacent.
–Notice that this is a first visited -- first explored
strategy. Therefore, it should be obvious that
a queue of vertices can be used