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

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

View Full Document Right Arrow Icon
Lecture 8 Dijkstra’s Algorithm for the Shortest Path Problem
Background image of page 1

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

View Full DocumentRight Arrow Icon
s t j). (i, arc of cost the is ij c
Background image of page 2
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.
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

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

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

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

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

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

View Full DocumentRight Arrow Icon
Dijkstra’s Algorithm
Background image of page 12
An Example 2 3 4 5 6 2 4 2 1 3 4 2 3 2 Initialize 1 0 Select the node with the minimum temporary distance label.
Background image of page 13

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

View Full DocumentRight Arrow Icon
Update Step 2 3 4 5 6 4 2 1 3 4 2 3 2 2 4 0 1
Background image of page 14
Choose Minimum Temporary Label 1 3 4 5 6 2 4 2 1 3 4 2 3 2 2 4 0 2
Background image of page 15

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

View Full DocumentRight Arrow Icon
Update Step 1 2 3 4 5 6 2 4 1 3 4 2 3 2 2 4 6 4 3 0 The predecessor of node 3 is now node 2
Background image of page 16
Choose Minimum Temporary Label 1 2 4 5 6 2 4 1 3 4 2 3 2 2 3 6 4 0 3
Background image of page 17

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

View Full DocumentRight Arrow Icon
Update 1 2 4 5 6 2 4 1 3 4 2 3 2 0 d(5) is not changed. 3 2 3 6 4
Background image of page 18
Choose Minimum Temporary Label 1 2 4 6 2 4 1 3 4 2 3 2 0 3 2 3 6 4 5
Background image of page 19

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

View Full DocumentRight Arrow Icon
Update 1 2 4 6 2 4 1 3 4 2 3 2 0 3 2 3 6 4 5 d(4) is not changed 6
Background image of page 20
Choose Minimum Temporary Label 1 2 6 2 4 1 3 4 2 3 2 0 3 2 3 6 4 5 6 4
Background image of page 21

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

View Full DocumentRight Arrow Icon
Update 1 2 6 2 4 1 3 4 2 3 2 0 3 2 3 6 4 5 6 4 d(6) is not updated
Background image of page 22
Choose Minimum Temporary Label 1 2 2 4 1 3 4 2 3 2 0 3 2 3 6 4 5 6 4 6 There is nothing to update
Background image of page 23

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

View Full DocumentRight Arrow Icon
Image of page 24
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/03/2010 for the course COMPUTER S CS 6363 taught by Professor Dingzhudu during the Fall '10 term at University of Texas at Dallas, Richardson.

Page1 / 51

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

This preview shows document pages 1 - 24. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online