AQA A level Computer Science
Teaching and Learning Resources
Chapter 13 – Dijkstra’s shortest path algorithm
TASK QUESTIONS (WITH ANSWERS)
1
Draw the graph that would be produced from the following array.
A
B
C
D
E
A
0
3
2
0
0
B
3
0
0
3
0
C
2
4
0
4
2
D
0
3
4
0
4
E
0
0
2
4
0
4
C
B
2
2
3
3
A
D
E
2
Write the array that would be needed to create the following graph:
4
4
A
B
E
3
2
G
5
1
7
C
7
5
3
F
2
D
A
B
C
D
E
F
G
A
0
4
2
0
0
0
0
B
4
0
2
7
4
0
0
C
2
3
0
3
0
0
0
D
0
7
3
0
1
2
0
E
0
4
0
1
0
5
5
F
0
0
0
2
5
0
5
G
0
0
0
0
7
5
0
AQA A level Computer Science
© Hodder & Stoughton Limited 2015
AQA A level Computer Science
Teaching and Learning Resources
3
Using this graph, trace Dijkstra’s algorithm to show the shortest path between A and G.
Shortest path should be A,C,D,F,G.
AQA A level Computer Science
© Hodder & Stoughton Limited 2015