This preview shows pages 1–5. 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 Document
Unformatted text preview: Algorithms in Systems Engineering IE170 Lecture 17 Dr. Ted Ralphs IE170 Lecture 17 1 References for Todays Lecture Required reading CLRS Chapter 24 References R. Sedgewick, Algorithms in C++ (Third Edition), 1998. IE170 Lecture 17 2 Dijkstras Algorithm We will assume for now that the edge lengths are all positive. The idea of Dijkstras Algorithm is to perform a graph search, updating the shortest known path to each encountered vertex as the search evolves. Throughout the algorithm, we maintain a quantity d ( v ) for each node v , which represents the length of the shortest path found so far. We will call d ( v ) the current estimate for node v . We start by assigning d ( r ) = 0 for the source node and d ( v ) = for all other nodes v . The node v to be processed next is the unprocessed node for which d ( v ) is minimized. The processing step consists of updating the estimates for all the neighbors of v . IE170 Lecture 17 3 Algorithm Summary...
View
Full
Document
 Spring '07
 Ralphs
 Systems Engineering

Click to edit the document details