Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Given a weighted graph where weights of all e...
Start Learning for Free
Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.
- a)True
- b)False
Correct answer is option 'B'. Can you explain this answer?
Most Upvoted Answer
Given a weighted graph where weights of all edges are unique (no two e...
Explanation:
In a weighted graph where all edge weights are unique, there can be multiple shortest paths from a source to a destination. Therefore, option 'B' is the correct answer.
Why there can be multiple shortest paths?
To understand why there can be multiple shortest paths in such a graph, let's consider an example.
Consider the following weighted graph:
```
A
/ \
3/ \5
/ \
B---2--->C
\ /
4\ /6
\ /
D
```
In this graph, the weights of the edges are unique (3, 2, 4, 5, 6). Now, let's find the shortest path from vertex A to vertex D.
Possible Shortest Paths:
There can be multiple shortest paths from A to D in this graph:
1. A -> B -> D (total weight = 3 + 4 = 7)
2. A -> C -> D (total weight = 5 + 6 = 11)
Both of these paths have unique edge weights and are the shortest paths from A to D.
Conclusion:
In a weighted graph where all edge weights are unique, there can be multiple shortest paths from a source to a destination. Therefore, the statement "there is always a unique shortest path from a source to destination in such a graph" is false.
In a weighted graph where all edge weights are unique, there can be multiple shortest paths from a source to a destination. Therefore, option 'B' is the correct answer.
Why there can be multiple shortest paths?
To understand why there can be multiple shortest paths in such a graph, let's consider an example.
Consider the following weighted graph:
```
A
/ \
3/ \5
/ \
B---2--->C
\ /
4\ /6
\ /
D
```
In this graph, the weights of the edges are unique (3, 2, 4, 5, 6). Now, let's find the shortest path from vertex A to vertex D.
Possible Shortest Paths:
There can be multiple shortest paths from A to D in this graph:
1. A -> B -> D (total weight = 3 + 4 = 7)
2. A -> C -> D (total weight = 5 + 6 = 11)
Both of these paths have unique edge weights and are the shortest paths from A to D.
Conclusion:
In a weighted graph where all edge weights are unique, there can be multiple shortest paths from a source to a destination. Therefore, the statement "there is always a unique shortest path from a source to destination in such a graph" is false.
Free Test
FREE
| Start Free Test |
Community Answer
Given a weighted graph where weights of all edges are unique (no two e...
There can be more than one paths with same weight. Consider a path with one edge of weight 5 and another path with two edges of weights 2 and 3. Both paths have same weights.
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Top Courses for Computer Science Engineering (CSE)View all
Question Description
Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer?.
Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer?.
Solutions for Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer?, a detailed solution for Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? has been provided alongside types of Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Given a weighted graph where weights of all edges are unique (no two edge have same weights), there is always a unique shortest path from a source to destination in such a graph.a)Trueb)FalseCorrect answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup