Partial 2 Homework Question 1: Solution

Dijkstra’s algorithm is used for finding shortest paths from a source

node to the rest of the nodes inside a graph. This algorithm

doesn’t determine correct solutions for weighted graphs with

negative values.




Find an example of such behavior and explain, in your own words,

what happens with the algorithm when a graph has negative

weights.