Dijkstra's shortest$-$path algorithm to find minimum travel time from $A$ to $B$

$A,B,C,D$ are called nodes. $A$ is the origin and $B$ is the destination

Assign infinity for travel times to all nodes $($except to the origin node $A,$ which is zero$)$

Select a node that has the smallest travel time value to begin with in the network

Find neighbors to the node selected in step $2$ and update their respective travel times with lower travel times

Store all visited nodes one$-$by$-$one and stop when the last stored node is the destination node, else repeat step $2$ to $4.$