Watch the video tutorial on Dijkstra's algorithm and and complete both tables to find the shortest paths.
Using Dijkstra’s shortest path algorithm complete the table to show the shortest path from A to H.
Using Dijkstra’s shortest path algorithm show the shortest path between nodes F and C.