Moderate -1.0 This is a standard D1 (Decision Mathematics) question on network algorithms, not actually about fixed point iteration despite the topic label. The question involves applying Dijkstra's algorithm or similar shortest path methods to a weighted graph - a routine algorithmic procedure taught at AS-level. While it requires careful bookkeeping, it's a straightforward application of a learned algorithm with no novel problem-solving required, making it easier than average A-level questions.
This insert should be used to answer Questions 4 and 7.
Write your name, centre number and candidate number in the spaces provided at the top of this page.
Write your answers to Questions 4 and 7 in the spaces provided in this insert, and attach it to your answer booklet.
4
\(A\)
\(B\)
C
D
\(E\)
\(F\)
G
\(H\)
A
-
4
2
3
-
-
-
-
\(B\)
4
-
1
-
3
-
-
-
C
2
1
-
2
-
6
5
-
\(D\)
3
-
2
-
-
-
4
-
E
-
3
-
-
-
8
-
7
\(F\)
-
-
6
-
8
-
-
8
\(G\)
-
-
5
4
-
-
-
9
\(H\)
-
-
-
-
7
8
9
-
B
\(E\)
\(C\)
F
\(H\)
\(A\)
•
\({ } ^ { \text {F } }\)
H
D
G
\(\_\_\_\_\)
\(\_\_\_\_\)
\(\_\_\_\_\)
7
\includegraphics[max width=\textwidth, alt={}, center]{197624b2-ca67-4bad-9c2c-dc68c10be0fd-11_191_1179_269_482}
Do not cross out your working values (temporary labels)
\includegraphics[max width=\textwidth, alt={}, center]{197624b2-ca67-4bad-9c2c-dc68c10be0fd-11_871_1557_612_335}
Shortest route from \(A\) to \(E =\) \(\_\_\_\_\) Length = \(\_\_\_\_\)
Shortest route from \(A\) to \(J =\) \(\_\_\_\_\) Length = \(\_\_\_\_\)
Length of route \(=\) \(\_\_\_\_\)
Vertices visited in order \(\_\_\_\_\)