I\'m a bit confused on how to calculate the shortest path from a node a to a node b using breadth first search.
In particular, I want to know how to calculate the shorte
