{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

demo-dijkstra

# demo-dijkstra - Di jkstr a's Shor test Path Al gor i thm Fi...

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

1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6

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

View Full Document
2 Dijkstra's Shortest Path Algorithm s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6 0 distance label S = { } PQ = { s, 2, 3, 4, 5, 6, 7, t }
3 Dijkstra's Shortest Path Algorithm s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6 0 distance label S = { } PQ = { s, 2, 3, 4, 5, 6, 7, t } delmin

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

View Full Document
4 Dijkstra's Shortest Path Algorithm s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6 15 9 14 0 distance label S = { s } PQ = { 2, 3, 4, 5, 6, 7, t } decrease key X X X
5 Dijkstra's Shortest Path Algorithm s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6 15 9 14 0 distance label S = { s } PQ = { 2, 3, 4, 5, 6, 7, t } X X X delmin

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

View Full Document
6 Dijkstra's Shortest Path Algorithm s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6 15 9 14 0 S = { s, 2 } PQ = { 3, 4, 5, 6, 7, t } X X X
7 Dijkstra's Shortest Path Algorithm s 3 t 2 6 7 4 5 24 18 2 9 14 15 5 30 20 44 16 11 6 19 6 15 9 14

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}