Question

In a weighted graph, the shortest path between two nodes is the path with

the sum of edge weights on the path.

Question image 1