Another example of using Dijkstra's Algorithm to find minimum weight paths in a connected weighted graph.