Consider the following weighted diagraph. What is the shortest distance between V1 to V5?

Explanation

The direct edge V1 → V5 costs 120. The path V1 → V4 → V5 costs 50 + 80 = 130, and V1 → V2 → V3 → V5 costs 30 + 70 + 30 = 130. So the shortest distance is 120.