Is the following statement valid?.
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
Answer: (B)
Explanation: 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.
Quiz of this Question
Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!
… [Trackback]
[…] Read More to that Topic: geeksforgeeks.org/algorithms-graph-shortest-paths-question-14/ […]
… [Trackback]
[…] Find More to that Topic: geeksforgeeks.org/algorithms-graph-shortest-paths-question-14/ […]