Question $16$

$15$ pts

Consider the following weighted graph.

Draw the resulting shortest path tree using Dijkstra's Algorithm starting at $A.$

Using the shortest path tree based on Dijkstra's Algorithm, calculate the following:

the distance for each of the vertices from $A($given $A$ is $0)$

the parent of each node $($given $A$ is null$)$

the dequeue sequence $($given $A$ is $1$ ; the rest would be $2,3,4,5,6$ in the order in which the vertices are dequeued and added to the tree$)$

Note: Do not leave any spaces at the beginning, in the middle, or at the end of your answers.

Note: Do not leave any spaces at the beginning, in the middle, or at the end of your answers.

$\backslash$table$[[$Vertices$,$Distance from A$,$Parent,$\backslash$table$[[$Dequeue$],[$Sequence$]]],[$A$,0,$null,$1],[$B$,,,],[$C$,,,],[$D$,,,],[$E$,,,],[$F$,,,]]$

No new data to save. Last checked at $6$:$01$pm