| Exam Board | OCR MEI |
| Module | D2 (Decision Mathematics 2) |
| Year | 2005 |
| Session | June |
| Topic | Shortest Path |
3 The distance and route matrices shown in Fig. 3.1 are the result of applying Floyd's algorithm to the incomplete network on 4 vertices shown in Fig. 3.2.
Distance Matrix
\begin{center}
\begin{tabular}{ | c | c | c | c | c | }
\multicolumn{1}{l}{} & \(\mathbf { 1 }\) & \(\mathbf { 2 }\) & \(\mathbf { 3 }\) & \(\mathbf { 4 }\)
\hline
\(\mathbf { 1 }\) & 4 & 2 & 3 & 9
\hline
\(\mathbf { 2 }\) & 2 & 2 & \(\mathbf { 1 }\) & 7
\hline
\(\mathbf { 3 }\) & 3 & \(\mathbf { 1 }\) & 2 & 6
\hline