Question discussion

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

360082Medium DSSSB TGT Computer Science 0 replies 0 views
0
Consider the following weighted diagraph. What is the shortest distance between V1 to V5?

Figure for question 178

  • A140
  • B120
  • C130
  • D110
Correct answer: B

Explanation

The direct edge V1–V5 costs 120. Other paths, such as V1–V4–V5 = 50 + 80 = 130, are longer, so the shortest distance is 120.

Discussion 0

Nobody has replied yet. Start the discussion!