3 The weights on the network represent distances.
\includegraphics[max width=\textwidth, alt={}, center]{88acde67-e22b-478a-9145-48abe931beff-3_401_702_315_683}
- Apply Floyd's algorithm to the network to find the complete network of shortest distances, showing that the final matrices are as follows.
\begin{center}
\begin{tabular}{ | c | c | c | c | c | }
\cline { 2 - 5 }
\multicolumn{1}{c|}{} & \(\mathbf { 1 }\) & \(\mathbf { 2 }\) & \(\mathbf { 3 }\) & \(\mathbf { 4 }\)
\hline
\(\mathbf { 1 }\) & 22 & 14 & 11 & 23
\hline
\(\mathbf { 2 }\) & 14 & 28 & 15 & 27
\hline
\(\mathbf { 3 }\) & 11 & 15 & 22 & 12
\hline