The Breadth-First Search (BFS) algorithm is just another basic technique for graph traversal and is aimed at getting the shortest path in the fewest steps possible, with the trade-off of being expensive in memory; thus, it is aimed especially at games for high-end consoles and computers.
Finding the shortest path in a grid with BFS
Getting ready
This is a high-level algorithm that relies on each graph's implementation of the general functions, so the algorithm is implemented in the Graph class.
How to do it...
Even though this recipe is only defining a function, please...