This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 6 {2, 4, 1, 3, 5, 6} 3 21 3 23 2 24 3 245 5 2456 12.8 Repeat Problem 12.7 using the BellmanFord algorithm. h L h (1) Path L h (3) Path L h (4) Path L h (5) Path L h (6) Path 0 ∞ — ∞ — ∞ — ∞ — ∞ — 1 3 21 3 23 2 24 ∞ — ∞ — 2 3 21 3 23 2 24 3 245 8 236 3 3 21 3 23 2 24 3 245 5 2456 4 3 21 3 23 2 24 3 245 5 2456 12.11 Will Dijkstra’s algorithm and the BellmanFord algorithm always yield the same solutions? Why or why not? If there is a unique leastcost path, the two algorithms will yield the same result because they are both guaranteed to find the leastcost path. If there are two or more equal leastcost paths, the two algorithms may find different leastcost paths, depending on the order in which alternatives are explored....
View
Full
Document
This note was uploaded on 11/02/2010 for the course EE 136 taught by Professor Kang xi during the Spring '10 term at NYU Poly.
 Spring '10
 KANG XI

Click to edit the document details