HomeData Modelling & AIAlgorithms | Graph Shortest Paths | Question 12

Algorithms | Graph Shortest Paths | Question 12

Is the following statement valid about shortest paths?
Given a graph, suppose we have calculated shortest path from a source to all other vertices. If we modify the graph such that weights of all edges is becomes double of the original weight, then the shortest path remains same only the total weight of path changes.
(A) True
(B) False

Answer: (A)
Explanation: The shortest path remains same. It is like if we change unit of distance from meter to kilo meter, the shortest paths don’t change.
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!
RELATED ARTICLES

1 COMMENT

Most Popular

Dominic
32714 POSTS0 COMMENTS
Milvus
131 POSTS0 COMMENTS
Nango Kala
7090 POSTS0 COMMENTS
Nicole Veronica
12230 POSTS0 COMMENTS
Nokonwaba Nkukhwana
12313 POSTS0 COMMENTS
Shaida Kate Naidoo
7208 POSTS0 COMMENTS
Ted Musemwa
7472 POSTS0 COMMENTS
Thapelo Manthata
7192 POSTS0 COMMENTS
Umr Jansen
7173 POSTS0 COMMENTS