Question: Professor F. Lake suggests the following algorithm for finding the shortest path from node s to node t in a directed graph with some negative
Professor F. Lake suggests the following algorithm for finding the shortest path from node s to node t in a directed graph with some negative edges: add a large constant to each edge weight so that all the weights become positive, then run Dijkstra’s algorithm starting at node s, and return the shortest path found to node t. (*)
Is this a valid method? Either prove that it works correctly, or give a counterexample
Step by Step Solution
3.47 Rating (150 Votes )
There are 3 Steps involved in it
To determine if Professor F Lakes suggested algorithm is valid we need to assess whether adding a large constant to each edge weight to make all the w... View full answer
Get step-by-step solutions from verified subject matter experts
