Incomplete Dijkstra reconstruction

A question is this type if and only if it provides a partially completed Dijkstra's algorithm diagram and asks to deduce missing edge weights or complete the labelling.

3 questions · Standard +0.4

7.04a Shortest path: Dijkstra's algorithm
Sort by: Default | Easiest first | Hardest first
Edexcel FD1 AS 2021 June Q4
8 marks Challenging +1.2
4. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{d3f5dcb4-3e23-4d78-965a-a1acaac13819-05_712_1433_223_315} \captionsetup{labelformat=empty} \caption{Figure 2}
\end{figure} Dijkstra's algorithm has been applied to the network in Figure 2.
A working value has only been replaced at a node if the new working value is smaller.
  1. State the length of the shortest path from A to G .
  2. Complete the table in the answer book giving the weight of each arc listed. (Note that arc CE and arc EF are not in the table.)
  3. State the shortest path from A to G. It is now given that
OCR D1 2006 January Q2
6 marks Moderate -0.8
2 Answer this question on the insert provided.
\includegraphics[max width=\textwidth, alt={}]{8f17020a-14bf-4459-9241-1807b954a629-2_659_1136_1720_530}
This diagram shows part of a network. There are other arcs connecting \(D\) and \(E\) to other parts of the network. Apply Dijkstra's algorithm starting from \(A\), as far as you are able, showing your working. Note: you will not be able to give permanent labels to all the vertices shown.
OCR FD1 AS 2018 March Q2
8 marks Standard +0.8
2 The diagram shows an incomplete solution to the problem of using Dijkstra's algorithm to find a shortest path from \(A\) to \(F\). Any cell that has values in it is complete. \includegraphics[max width=\textwidth, alt={}, center]{a51b112d-1f3f-4214-94c1-8b9cd7eb831c-2_650_1246_1107_411}
  1. (a) Find the missing weight on \(\operatorname { arc } B E\).
    (b) What can you deduce about the missing weight on arc \(C D\) ? You are now given that the weight of arc \(C E\) is not 3 .
  2. (a) What can you deduce about the missing weight on arc \(C E\) ?
    (b) Complete the labelling of the boxes at \(E\) and \(F\) on the diagram in the Printed Answer Booklet. [2] Suppose that there are two shortest routes from \(A\) to \(F\).
  3. Show how trace back is used to find the shortest routes from \(A\) to \(F\).