Question $4(15\mathrm{.}0$ marks$)$

Consider the following network. With the indicated link costs, use Dijkstra$$s shortestpath algorithm to compute the shortest path from $0$ to all network nodes.

$($i$)$ Show how the algorithm works by computing a table $($adjacency matrix$),$ like the

one discussed in class. $(10\mathrm{.}0$ marks$)$

$($ii$)$ Show all the paths from $0$ to all other network nodes. $(5\mathrm{.}0$ marks$)$Question $4(15\mathrm{.}0$ marks$)$

Consider the following network. With the indicated link costs, use Dijkstra's shortestpath algorithm to compute the shortest path from $0$ to all network nodes.

$($i$)$ Show how the algorithm works by computing a table $($adjacency matrix$),$ like the one discussed in class.

$(10\mathrm{.}0$ marks$)$

$($ii$)$ Show all the paths from $0$ to all other network nodes.

$(5\mathrm{.}0$ marks$)$