CS223-0325-Dijkstra

# CS223-0325-Dijkstra - 7 Dijkstras Algorithm Dijkstras...

This preview shows pages 1–14. Sign up to view the full content.

CS223 Advanced Data Structures and Algorithms 1 Dijkstra’s Shortest Path Algorithm Dijkstra’s Shortest Path Algorithm Neil Tang Neil Tang 03/25/2008 03/25/2008

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CS223 Advanced Data Structures and Algorithms 2 Class Overview Class Overview The shortest path problem Applications Dijkstra’s algorithm Implementation and time complexities
CS223 Advanced Data Structures and Algorithms 3 Shortest Path Problem Shortest Path Problem Weighted path length (cost): The sum of the weights of all links on the path. The single-source shortest path problem: Given a weighted graph G and a source vertex s, find the shortest (minimum cost) path from s to every other vertex in G.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CS223 Advanced Data Structures and Algorithms 4 An Example An Example
CS223 Advanced Data Structures and Algorithms 5 Another Example Another Example

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CS223 Advanced Data Structures and Algorithms 6 Applications Applications Digital map Computer network Travel planning
CS223 Advanced Data Structures and Algorithms

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 7 Dijkstras Algorithm Dijkstras Algorithm CS223 Advanced Data Structures and Algorithms 8 Dijkstras Algorithm Dijkstras Algorithm CS223 Advanced Data Structures and Algorithms 9 Dijkstras Algorithm Dijkstras Algorithm CS223 Advanced Data Structures and Algorithms 10 Dijkstras Algorithm Dijkstras Algorithm CS223 Advanced Data Structures and Algorithms 11 Dijkstras Algorithm Dijkstras Algorithm CS223 Advanced Data Structures and Algorithms 12 Dijkstras Algorithm Dijkstras Algorithm CS223 Advanced Data Structures and Algorithms 13 Dijkstras Algorithm Dijkstras Algorithm CS223 Advanced Data Structures and Algorithms 14 Implementation and Time Complexities Implementation and Time Complexities Trivial: O(|V| 2 + |E|) = O(|V| 2 ) Heap: deleteMin |V| times + decreaseKey |E| times O(|V|log|V| + |E|log|V|) = O (|E|log|V|) Fibonacci heap: O(|E| + |V|log|V|)...
View Full Document

## This note was uploaded on 04/17/2008 for the course CS 223 taught by Professor Tang during the Spring '07 term at MSU Bozeman.

### Page1 / 14

CS223-0325-Dijkstra - 7 Dijkstras Algorithm Dijkstras...

This preview shows document pages 1 - 14. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online