Unformatted text preview: It wouldn't make sense to apply BellmanFord to an undirected graph with a negative edge weight, since any walk could be shortened by passing up and down that edge as often as desired. 24. (a) [BB] Dijkstra incorrectly determines that the length of a shortest path to V2 is 1. Dijkstra does not always work when applied to digraphs which have arcs of negative weight. (b) [BB] No shortest path algorithm will work. There is a negative weight cycle, hence no shortest distance to V2, for example. 25. (a) Because of the negative weight arcs, Dijkstra's algorithm does not find the correct shortest distances to C, D, E, and F, these being 3, 4, 4 and 1, respectively. (b) BellmanFord would work just fine, however, because there are no negative weight cycles....
View
Full Document
 Summer '10
 any
 Graph Theory, Shortest path problem, Dijkstra, V3 V4 V5

Click to edit the document details