Question $5(25$ marks$)$

Table Q$5$ below describes the logistics transportation with Direction and Distance between several cities $($Cities A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ G$,$ H$,$ I$).$ For example, the data set of in Table Q$5($from A to B$,$ the distance is $2)$ indicates the goods can be shipped from City A to City B $,$ and the corresponding path distance is $2$

Note: Transportation from City B to City A is not applicable.

$\backslash$table$[[$From$,$To$,$Distance,From,To$,$Distance$],[$A$,$B$,2,$D$,$F$,5],[$A$,$C$,4,$E$,$G$,3],[$A$,$D$,3,$E$,$H$,6],[$B$,$E$,7,$F$,$G$,4],[$B$,$F$,6,$F$,$H$,3],[$C$,$E$,2,$G$,$I,$6],[$C$,$F$,5,$H$,$I,$3],[$D$,$E$,3,,,]]$

Table Q$5-$ Information between the Cities

$($a$)$ Design and draw the logistics network between the cities according to Table Q$5$ above.

Note: The transportation direction and the distance should be marked in the diagram.

$(7$ marks$)$

$($b$)$ If goods need to be shipped from City A to City I, determine the shortest path in a Stepwise manner based on the Dijkstra algorithm.

$(8$ marks$)$

$($c$)$ Indicate all the possible shortest path$($s$)$ and the Minimum total distance.

$(5$ marks$)$

$($d$)$ Clarify the differences between the Greedy algorithm and Dijkstra's algorithm.

$(5$ marks$)$

End of Examination Paper $-$