Food Delivery Routing – Shortest Path (Dijkstra's Algorithm)

Choose a restaurant (source) and a customer (destination), then step through the algorithm.
Source Destination Current vertex Finalised (visited) Not visited
Number below each vertex = shortest known distance from the source (km). ∞ = not reached yet.

What is happening?

Distance table

All possible routes (smallest first)