Dijkstra's Shortest Path Algorithm Find shortest path from s to t 24 s 18 14 30 11 5 15 19 16 20 44 t Dijkstra's Shortest Path Algorithm S={ } PQ = { s, 2, 3, 4, 5, 6, 7, t }   s 24 18 14   30  11 5 15  19 16 20 6 distance label 44 t  Dijkstra's Shortest Path Algorithm S={ } PQ = { s, 2, 3, 4, 5, 6, 7, t } delmin   s 24 18 14   30  11 5 15  19 16 20 6 distance label 44 t  Dijkstra's Shortest Path Algorithm S={s} PQ = { 2, 3, 4, 5, 6, 7, t } decrease key  X  s 24 18 X 14  14  30  11 5 15 X  15 19 16 20 6 distance label 44 t  Dijkstra's Shortest Path Algorithm S={s} PQ = { 2, 3, 4, 5, 6, 7, t } delmin  X  s 24 18 X 14  14  30  11 5 15 X  15 19 16 20 6 distance label 44 t  Dijkstra's Shortest Path Algorithm S = { s, } PQ = { 3, 4, 5, 6, 7, t }  X  s 24 18 X 14  14  30  11 5 15 X  15 19 16 20 44 t  Dijkstra's Shortest Path Algorithm S = { s, } PQ = { 3, 4, 5, 6, 7, t } decrease key X  33 X  s 24 18 X 14  14  30  11 5 15 X  15 19 16 20 44 t  Dijkstra's Shortest Path Algorithm S = { s, } PQ = { 3, 4, 5, 6, 7, t } X  33 X  s 24 delmin 18 X 14  14  30  11 5 15 X  15 19 16 20 44 t  Dijkstra's Shortest Path Algorithm S = { s, 2, } PQ = { 3, 4, 5, 7, t } 32 X X  33 X  s 24 18 X 14  14 30  44 X  11 5 15 X  15 19 16 20 44 t  Dijkstra's Shortest Path Algorithm S = { s, 2, } PQ = { 3, 4, 5, 7, t } 32 X X  33 X  s 24 18 X 14  14 30  44 X  11 5 15 19 16 20 X  15 44 delmin t  Dijkstra's Shortest Path Algorithm S = { s, 2, 6, } PQ = { 3, 4, 5, t } 32 X X  33 X  s 24 18 X 14  14 30 44 X 35 X  5 15 X  15  11 19 16 20 44 t  59 X Dijkstra's Shortest Path Algorithm S = { s, 2, 6, } PQ = { 3, 4, 5, t } delmin 32 X X  33 X  s 24 18 X 14  14 30 44 X 35 X  5 15 X  15  11 19 16 20 44 t  59 X Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 6, } PQ = { 4, 5, t } 32 X X  33 X  s 24 18 X 14  14 30 44 X 34 X 35 X  5 15 X  15  11 19 16 20 44 t 51 59 X X  Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 6, } PQ = { 4, 5, t } 32 X X  33 X  s 24 18 X 14  14 30 X  15  11 19 20 44 X 34 X 35 X  5 15 delmin 44 16 t 51 59 X X  Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 5, 6, } PQ = { 4, t } 32 X X  33 X  s 24 18 X 14  14 30 44 X 34 X 35 X  5 15 X  15 11 45 X  19 16 20 44 t 50 51 X 59 X X  Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 5, 6, } PQ = { 4, t } 32 X X  33 X  s 24 18 X 14  14 30 44 X 34 X 35 X  5 15 X  15 11 45 X  19 delmin 16 20 44 t 50 51 X 59 X X  Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 4, 5, 6, } PQ = { t } 32 X X  33 X  s 24 18 X 14  14 30 44 X 34 X 35 X  5 15 X  15 11 45 X  19 16 20 44 t 50 51 X 59 X X  Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 4, 5, 6, } PQ = { t } 32 X X  33 X  s 24 18 X 14  14 30 44 X 34 X 35 X  5 15 X  15 11 45 X  19 16 20 t 44 delmin 50 51 X 59 X X  Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 4, 5, 6, 7, t} PQ = { } 32 X X  33 X  s 24 18 X 14  14 30 44 X 34 X 35 X  5 15 X  15 11 45 X  19 16 20 44 t 50 51 X 59 X X  Dijkstra's Shortest Path Algorithm S = { s, 2, 3, 4, 5, 6, 7, t} PQ = { } 32 X X  33 X  s 24 18 X 14  14 30 44 X 34 X 35 X  5 15 X  15 11 45 X  19 16 20 44 t 50 51 X 59 X X  .. .Dijkstra' s Shortest Path Algorithm S={ } PQ = { s, 2, 3, 4, 5, 6, 7, t }   s 24 18 14   30  11 5 15  19 16 20 6 distance label 44 t  Dijkstra' s Shortest Path Algorithm... distance label 44 t  Dijkstra' s Shortest Path Algorithm S={s} PQ = { 2, 3, 4, 5, 6, 7, t } decrease key  X  s 24 18 X 14  14  30  11 5 15 X  15 19 16 20 6 distance label 44 t  Dijkstra' s Shortest... 16 20 6 distance label 44 t  Dijkstra' s Shortest Path Algorithm S = { s, } PQ = { 3, 4, 5, 6, 7, t }  X  s 24 18 X 14  14  30  11 5 15 X  15 19 16 20 44 t  Dijkstra' s Shortest Path Algorithm