4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{103a0bcf-3adf-407c-aa98-a784b0b39bf5-04_577_1357_230_354}
\captionsetup{labelformat=empty}
\caption{Figure 1}
\end{figure}
[The total weight of the network is \(135 + 4 x + 2 y\) ]
The weights on the arcs in Figure 1 represent distances. The weights on the arcs CE and GH are given in terms of \(x\) and \(y\), where \(x\) and \(y\) are positive constants and \(7 < x + y < 20\)
There are three paths from A to H that have the same minimum length.
- Use Dijkstra's algorithm to find \(x\) and \(y\).
An inspection route starting at A and finishing at H is found. The route traverses each arc at least once and is of minimum length.
- State the arcs that are traversed twice.
- State the number of times that vertex C appears in the inspection route.
- Determine the length of the inspection route.