Example $3\mathrm{.}14.$ Obtain a shortest path between vertex $s$ and $t$ in the given

weighted digraph using dijkstra's algorithm $($Fig$.3\mathrm{.}49)$

Fig. $3\mathrm{.}49$