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

Article Tags :

DSA Quiz

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

Recommended Articles

1. Algorithms | Graph Shortest Paths | Question 14

2. Algorithms | Graph Shortest Paths | Question 2

3. Algorithms | Graph Shortest Paths | Question 3

4. Algorithms | Graph Shortest Paths | Question 4

5. Algorithms | Graph Shortest Paths | Question 14

6. Algorithms | Graph Shortest Paths | Question 8

7. Algorithms | Graph Shortest Paths | Question 9

8. Algorithms | Graph Shortest Paths | Question 10

9. Algorithms | Graph Shortest Paths | Question 11

10. Algorithms | Graph Shortest Paths | Question 13

11. Algorithms | Graph Shortest Paths | Question 14

12. Algorithms | Graph Shortest Paths | Question 15

13. Algorithms | Graph Shortest Paths | Question 7

14. Johnson’s algorithm for All-pairs shortest paths | Implementation

15. Number of paths from source to destination in a directed acyclic graph

16. Building an undirected graph and finding shortest path using Dictionaries in Python

17. Create a Graph by connecting divisors from N to M and find shortest path

18. Shortest path in a complement graph

19. Shortest path in a directed graph by Dijkstra’s algorithm

20. Algorithms | Graph Traversals | Question 2

21. Algorithms | Graph Minimum Spanning Tree | Question 1

22. Algorithms | Graph Minimum Spanning Tree | Question 2

23. Algorithms | Graph Minimum Spanning Tree | Question 3

24. Algorithms | Graph Minimum Spanning Tree | Question 4

25. Algorithms | Graph Minimum Spanning Tree | Question 5