Find the shortest path between source and destination using BFS. Note: BFS finds the shortest path in terms of number of edges, but this implementation also tracks edge weights for consistency with other algorithms. Args: graph: The graph to search. source:
(graph: Graph, source: Vertex, destination: Vertex)
source not stored for this graph (policy: none)