Multiple choice

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight of the edge {i, j}. W =

What is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?

  1. 7

  2. 8

  3. 9

  4. 10
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions