Edexcel D1 2005 June — Question 6

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2005
SessionJune
TopicShortest Path

6. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 5} \includegraphics[alt={},max width=\textwidth]{19cfdf0b-6be6-4f44-bfae-2b6bf592cfd8-6_577_1547_296_305}
\end{figure} Figure 5 shows a network of roads. The number on each arc represents the length of that road in km .
  1. Use Dijkstra's algorithm to find the shortest route from \(A\) to \(J\). State your shortest route and its length.
    (5)
  2. Explain how you determined the shortest route from your labelled diagram. The road from \(C\) to \(F\) will be closed next week for repairs.
  3. Find the shortest route from \(A\) to \(J\) that does not include \(C F\) and state its length.
    (3)
    (Total 10 marks)