$4.(20\backslash \%)$ Dijkstra algorithm $$ example graph$$ source $$s$\backslash ($ a $\backslash )$ destination $\backslash ($ t $\backslash )\backslash ($ f $\backslash )$

a$.5\backslash \%$ binary heap$$as an array$$ array $$ dist $$ dist $$ vertex id$$

b$.5\backslash \%$ round $$ binary heap$$as an array$$ array $$ dist $$ dist $$ vertex id$$

c$.\backslash ((10\backslash \%)\backslash )\backslash ($ a $\backslash )\backslash ($ f $\backslash )$