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
This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.
- Spring '10