Find the shorted path between Node $1$ and $6$ using any algorithm discussed in class:

Nodes pair distances:

$(4,1)0\mathrm{.}4500$

$(6,2)0\mathrm{.}4100$

$(2,3)0\mathrm{.}5100$

$(5,3)0\mathrm{.}3200$

$(6\mathrm{.}3)0\mathrm{.}2900$

$(3,4)0\mathrm{.}1500$

$(5,4)0\mathrm{.}3600$

$(1,5)0\mathrm{.}2100$

$(2,5)0\mathrm{.}3200$

$(1,6)0\mathrm{.}9900$

$(4,6)0\mathrm{.}3800$

Which algorithm was used?

Indicate which is the critical path:

What is the minimum distance?