This preview shows page 1. Sign up to view the full content.
Unformatted text preview: slide set lecture11graphs2.pdf and also on page 453 of your text. A E D C B 2 6 3 8 4 1 7 2 Show the operational table that lists steps, array D, and array P. 4. (a) Apply the allpairs shortest path algorithm to the graph you gave for the answer of Problem 1. (b) Does this algorithm terminate properly and does it give correct results for all paths? (c) What is the running time of allpairs? (d) What is the memory use? 5. Problem 9.15 on page 398. In your solutions, to break ties, use alphabetical ordering (if you have to select between an edge AD and BC, choose AD). Do not use this ordering for part (b). Be sure to show the all important steps as the data structures change....
View
Full
Document
 Spring '08
 M.McCullen
 Algorithms, Data Structures

Click to edit the document details