Question
Problem 2 (10 pt.) Find the shortest paths from node 1 to all other nodes on the following graph using Dijkstra's algorithm.
Question image 1