6-19. Use Dijkstra's algorithm to find the shortest route between node 1 and every other node in the network of Figure 6.42.