Homework $6$

Name: $q,$

ID#: $q,$

Completely answer the following question.

Consider the network shown in the figure below. With the indicated link costs, use Dijkstra's shortest$-$path algorithm to compute the shortest path from node $t$ to all network nodes. Show how the algorithm works by presenting your results in the table provided. $(10$ points$)$

$\backslash$table$[[$Step$,N,,D(u),p(u),D(v),p(v),D(w),p(w),D(x),p(x),D(y),p(y),D(z),p(z)$