# hw7 - source vertex s in a general weighted directed graph...

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

CSE 413, Analysis of Algorithms Fall Semester, 2004 Assignment 7: Graph Algorithms II Due Date : Nov. 24, 2004 (at the beginning of CSE 413 class) 1. The single-source shortest path algorithm discussed in class takes O (( | V | + | E | )log | V | ) time. That solution is good when | E | is not very large (i.e., | E | <O ( | V | 2 )). But, if | E | = c ∗| V | 2 for some constant c> 0, that algorithm is not very eﬃcient and one can do better than O (( | V | + | E | )log | V | )(wh ichinth iscasebecomes O ( | V | 2 log | V | )). Design an O ( | V |
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: source vertex s in a general weighted directed graph G = ( V, E ) (with no negative edge weights). ( 20 points ) 2. Problem 7.32, page 252. ( 20 points ) 3. Problem 7.39, page 253. (Note: The sought optimal path may start at any vertex and end at any other vertex.) ( 25 points ) 4. Problem 7.65, page 257. ( 20 points ) Total Points : 85...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online