3.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{5274a614-7862-49f0-ad1d-b59b73aa51ad-04_1047_1691_210_187}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
In Figure 1 the weight of \(\operatorname { arc } \mathrm { SB }\) is denoted by \(x\) where \(x \geqslant 0\)
- Explain why Dijkstra's algorithm cannot be used on the directed network in Figure 1.
(1)
It is given that the minimum weight route from S to T passes through B . - Use dynamic programming to find
- the range of possible values of \(x\)
- the minimum weight route from S to T .
(12)