dijkstra's algorithm - colleen young
DESCRIPTION
Find the shortest path in a networkTRANSCRIPT
Dijkstra’s Algorithm
An algorithm for finding the shortest path between two vertices in a graph
Start vertexorder label 1distance label 0
temporary labelsgiven to B, C, D
Shortest distancesAB 4 ACFBAC 2 ACAD 3 ADAE 5 ACFBEAF 3 ACFAG 6 ACFBFG