Unformatted text preview: d [] assigned to vertex b , as the algorithm executes. 2. Give a simple example of a directed graph with negativeweight edges for which Dijkstra’s algorithm produces incorrect answers. Why does the correctness proof of Dijkstra’s algorithm not go through when negativeweight 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
 may
 English

Click to edit the document details