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: 1 a b c d f e k h g j m n o Section 8.6 10. Use the Dijkstra's algorithm to find the shortest path from a to z for the following graph. The initialization is given in the graph. You need to show detailed steps. a b c d e f g z 5 3 6 3 10 9 4 8 3 12 7 + ∞, nil + ∞, nil + ∞, nil + ∞, nil + ∞, nil + ∞, nil + ∞, nil 0 , nil 1 2 Section 8.7 11. Page 611, Exercise 14 12. Page 611, Exercise 16 13. Page 611, Exercise 22 2...
View
Full
Document
This note was uploaded on 04/12/2008 for the course CS 291 taught by Professor Shen during the Winter '04 term at University of MissouriKansas City .
 Winter '04
 Shen

Click to edit the document details