Dijkstra's shortest path algorithm is run on the graph, starting at vertex $D.$ When a vertex is dequeued, $0$ or more adjacent vertices' distances are updated.

For each iteration of the while loop in Dijkstra's algorithm, find the vertex dequeued and the adjacent vertices updated. Enter updated vertices as A$,$ B$,$ C or "none" if no adjacent vertices are updated.

$\backslash$table$[[$Iteration$,$Vertex dequeued,Adjacent vertices updated$],[1,$Ex: C$,$Ex: A$,$ B$,$ C or none$],[2,,],[3,,],[4,,],[5,,]]$