Lecture17

# Lecture17 - Algorithms in Systems Engineering IE170 Lecture...

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

Algorithms in Systems Engineering IE170 Lecture 17 Dr. Ted Ralphs

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

View Full Document
IE170 Lecture 17 1 References for Today’s Lecture Required reading CLRS Chapter 24 References R. Sedgewick, Algorithms in C++ (Third Edition), 1998.
IE170 Lecture 17 2 Dijkstra’s Algorithm We will assume for now that the edge lengths are all positive. The idea of Dijkstra’s 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 .

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

View Full Document
IE170 Lecture 17 3 Algorithm Summary We are given a graph G = ( V, E )
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern