BFS finds a "shortest" path

• based on minimum # edges between src and dest.
• stops with first-found path, if there are multiple ones

In many applications, edges are weighted and we want path

• based on minimum sum-of-weights along path src .. dest