Question

Challenge Problem: Shortest Paths With Negative Edges In class, we discussed Dijkstra's Algorithm for finding all shortest paths. Dijkstra's Algorithm has a restriction: all edge costs must be positive. Learning Objectives Topic: Graph Algorithms. Remember that completing a challenge problem on a topic does not count toward proficiency for that topic. . Pair Project: No. Instructions Suppose that you are given a graph with exactly 1 negative weight edge and no negative cycles Design an algorithm that finds the shortest paths from a start node S to a destination node T in such a graph. Prove that your algorithm is correct. Note: I am aware of two general approaches to solving this problem. One is to modify Dijkstra's Algorithm. The other is to use the Floyd-Warshall Algorithm (which we have not discussed). If you want to use the latter, you must prove that the F-W Algorithm is correct. Since it is a dynamic programming algorithm, I would then expect to see your Bellman Eguation,matrix of subproblem solutions,and where to look for the answer in the matrix

          Challenge Problem: Shortest Paths With Negative Edges
In class, we discussed Dijkstra's Algorithm for finding all shortest paths. Dijkstra's Algorithm has a restriction: all edge
costs must be positive.
Learning Objectives
Topic: Graph Algorithms*. Remember that completing a challenge problem on a topic does not count toward
proficiency for that topic. . Pair Project: No.
Instructions
Suppose that you are given a graph with exactly 1 negative weight edge and no negative cycles
Design an algorithm that finds the shortest paths from a start node S to a destination node T in such a graph. Prove that
your algorithm is correct.
*Note: I am aware of two general approaches to solving this problem. One is to modify Dijkstra's Algorithm. The other is to use the Floyd-Warshall Algorithm (which we have not discussed). If you want to use the latter, you must prove that the F-W Algorithm is correct. Since it is a dynamic programming algorithm, I would then expect to see your Bellman
Eguation,matrix of subproblem solutions,and where to look for the answer in the matrix

challenge problem shortest paths with negative edges in class we discussed dijkstras algorithm for finding all shortest paths dijkstras algorithm has a restriction all edge costs must be pos 56065

Added by Consuelo W.

Question

Please give Ace some feedback