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: 4 3 2-1 3 2-3 2 2-4 3 2-4-5 5 2-4-5-6 12.11 Will Dijkstras algorithm and the Bellman-Ford algorithm always yield the same solutions? Why or why not? If there is a unique least-cost path, the two algorithms will yield the same result because they are both guaranteed to find the least-cost path. If there are two or more equal least-cost paths, the two algorithms may find different least-cost paths, depending on the order in which alternatives are explored....
View Full Document
This note was uploaded on 09/10/2011 for the course EE 135 taught by Professor Dong during the Spring '11 term at NYU Poly.
- Spring '11