Lecture17-shortestpaths

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

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

View Full Document
Announcements § Project #3 § Credentials to access homework keys and reviews § Reviews: due Tuesday § If no reviews received, say so in your reviewer response § Final proofs: due Thursday § Questions? § Project #4 Help session
Objectives § Find shortest paths § Formulate problems as graph problems on weighted graphs § Introduce Dijkstra’s algorithm

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

View Full Document
Chapter 3 vs. Chapter 4 § Chapter 3 is all about connectivity in graphs § Formulating problems as graphs § Can I get from a to b? § Chapter 4 is all about paths in graphs § Formulating problems as weighted graphs § What's the cheapest (e.g., shortest) path from a to b?
Recall: Depth-First Search

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

View Full Document
DFS for Shortest Paths?
DFS for Shortest Paths?

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

View Full Document
Edges as Strings
Edges as Strings

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

View Full Document
BFS Analysis :
BFS

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

View Full Document
BFS Example Queue: Additionally, track the prev / parent attribute prev dist
BFS Example Queue: Additionally, track the prev / parent attribute

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

View Full Document
BFS Queue and Shortest Paths Tree
§ Is it correct? § How long does it take?

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.

{[ snackBarMessage ]}