hw09 - vertex v to vertex u Assume that all the edge...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE331 Section 2 Homework 9 Due: Friday April 4, 2008 at 11:59am 1. Problem 9.5 on page 397, using Dijkstra’s algorithm. To show that you go through the algorithm, show the operational table that lists (i) steps, (ii) queue content, (iii) min in Q, and (iv) result (v,d). . 2. Problem 9.7, part a, on page 397. Show how your solution results in the wrong an- swer. Try to keep your graph as small as possible. 3. Problem 9.10 part a. List only the statements in Dijkstra’s algorithm that need to be changed. Let count[u] to be the number of different minimum paths from the starting
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: vertex v to vertex u. Assume that all the edge weights are positive and not zero. 4. Find the all pairs shortest paths (Warshall’s algorithm) on the following graph: 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. 5. Problem 9.15 on page 398. In your solutions, to break ties, use alphabetical ordering (if you have to select between an edge A-D and B-C, choose A-D). Do not consider this ordering for part b. Give a smallest example to explain your answer to part b....
View Full Document

This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.

Ask a homework question - tutors are online