{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# lect08 - Lecture 8 Dijkstras Algorithm for the Shortest...

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

Lecture 8 Dijkstra’s Algorithm for the Shortest Path Problem

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

View Full Document
s t j). (i, arc of cost the is ij c
Dynamic Programming } ) ( * { min ) ( * Then . node to node origin from path shortest of length the denote ) ( * Let ) ( vu u N v c v d u d u s u d + = - Dijkstra’s Algorithm is a way to implement this dynamic programming.

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 preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Dijkstra’s Algorithm
An Example 1 2 3 4 5 6 2 4 2 1 3 4 2 3 2 Initialize 0 Select the node with the minimum temporary distance label.

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

View Full Document
Update Step 2 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 1
Choose Minimum Temporary Label 1 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 2

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

View Full Document
Update Step 1 2 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 6 4 3 0 The predecessor of node 3 is now node 2
Choose Minimum Temporary Label 1 2 4 5 6 2 4 2 1 3 4 2 3 2 2 3 6 4 0 3

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

View Full Document
Update 1 2 4 5 6 2 4 2 1 3 4 2 3 2 0 d(5) is not changed. 3 2 3 6 4
Choose Minimum Temporary Label 1 2 4 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5

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

View Full Document
Update 1 2 4 6 2 4 2 1 3 4 2 3 2 0 3 2 3 6 4 5 d(4) is not changed 6
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