We're using the version of Dijkstra's algorithm described here in lecture: note that the fringe and distTo data structures are always changed at the same time.

Give the resulting edgeTo and distTo maps after vertex

B

B is visited $($i$.$e$.$ its outgoing edges to C and E have been relaxed$).$ Also give the resulting edgeTo and distTo maps after Dijkstra's algorithm has completely finished execution. Initialize the edgeTo for each vertex as $-$ which will represent null for us$.$ Initialize the distTo for each vertex as inf which we$$ll use to represent

$\backslash$infty

$\backslash$infty $,$ except for

S

S where it should be

$0$

$0.$

So$,$ before the first iteration, the values of these variables are: