This preview shows page 1. Sign up to view the full content.
Unformatted text preview: d assigned to vertex b , as the algorithm executes. 2. Give a simple example of a directed graph with negative-weight edges for which Dijk-stra’s algorithm produces incorrect answers. Why does the correctness proof of Dijkstra’s algorithm not go through when negative-weight edges are allowed? 1...
View Full Document
- Spring '10