Find the shortest path in a weighted graph

A classic graph algorithm problem testing understanding of pathfinding techniques like Dijkstra's or Bellman-Ford algorithm. Requires knowledge of graph traversal, shortest path algorithms, and efficient implementation strategies.