Final answer:
Dijkstra's Algorithm does not work with negative weights because it assumes all edges have non-negative weights and can enter into an infinite loop in the presence of negative weights.
Step-by-step explanation:
Dijkstra's Algorithm is a graph traversal algorithm that finds the shortest path between nodes in a graph. However, it does not work with negative weights because it assumes that all edges of the graph have non-negative weights. If there are negative weights, the algorithm can enter into an infinite loop, as it may keep revisiting nodes and updating the distances to achieve a shorter path. This is known as 'negative weight cycle.'
For example, consider a graph with two nodes A and B, connected by an edge with weight -5. If we use Dijkstra's Algorithm to find the shortest path from A to B, it will keep revisiting the edge and decreasing the distance, leading to an infinite loop.