

MCQOPTIONS
Saved Bookmarks
1. |
In the graph given in above question, 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? |
A. | 7 |
B. | 8 |
C. | 9 |
D. | 10 |
Answer» C. 9 | |