Question 8117 – Data-Structures
April 18, 2024Question 9066 – Data-Structures
April 18, 2024Question 9065 – Data-Structures
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}.
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?
Correct Answer: B
Question 56 Explanation:
The minimum possible weight of a path p from vertex 1 to vertex 2 such that p contains atmost 3 edges,
= 1 + 4 + 3
= 8
7
8
9
10
Subscribe
Login
0 Comments