A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Consider a weighted undirected graph with positive edge weights and let uv be an edge in the graph. It is known that the shortest path from the source vertex s to u has weight 53 and the shortest path from s to v has weight 65. Which one of the following statements is always true?
a. weight (u, v) < 12
b. weight (u, v) ≤ 12
c. weight (u, v) > 12
d. weight (u, v) ≥ 12
Answer:weight (u, v) ≥ 12
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: