dijkstra's algorithm - colleen young
DESCRIPTION
Find the shortest path in a networkTRANSCRIPT
![Page 1: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/1.jpg)
Dijkstra’s Algorithm
An algorithm for finding the shortest path between two vertices in a graph
![Page 2: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/2.jpg)
![Page 3: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/3.jpg)
Start vertexorder label 1distance label 0
temporary labelsgiven to B, C, D
![Page 4: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/4.jpg)
![Page 5: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/5.jpg)
![Page 6: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/6.jpg)
![Page 7: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/7.jpg)
![Page 8: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/8.jpg)
![Page 9: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/9.jpg)
![Page 10: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/10.jpg)
![Page 11: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/11.jpg)
![Page 12: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/12.jpg)
![Page 13: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/13.jpg)
![Page 14: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/14.jpg)
![Page 15: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/15.jpg)
![Page 16: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/16.jpg)
![Page 17: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/17.jpg)
![Page 18: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/18.jpg)
![Page 19: Dijkstra's Algorithm - Colleen Young](https://reader035.vdocuments.net/reader035/viewer/2022062404/55499b1fb4c905a6758b48c2/html5/thumbnails/19.jpg)
Shortest distancesAB 4 ACFBAC 2 ACAD 3 ADAE 5 ACFBEAF 3 ACFAG 6 ACFBFG