This preview shows pages 1–11. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 2 3 4 y y d(y) = 3 z z d(z) = 4 Shortest paths Shortest paths Couple of remarks The Dijkstras algo does not explicitly compute the shortest path Can maintain shortest path tree separately Dijkstras algorithm does not work with negative weights Left as an exercise Rest of Todays agenda Prove the correctness of Dijkstras Algorithm Runtime analysis of Dijkstras Algorithm Reading Assignment Sec 4.4 of [KT] Building a fiber network Lay down fibers to connect n locations All n locations should be connected Laying down a fiber costs money What is the cheapest way to lay down the fibers?...
View Full
Document
 Fall '11
 RUDRA

Click to edit the document details