Error
There was an error loading the page.
Students are shown a graph with 6 vertices and asked to find the length of the shortest path from A to a random vertex.
There is only one graph, but all of the weights are randomised.
They can find the length any way they wish. In the advice, the steps of Dijkstra's algorithm used in solving this problem are displayed. It is not a complete worked solution but it should be sufficient to figure out the shortest path used to reach each vertex.
Metadata
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Contributors
Feedback
From users who are members of Standard Maths :
Merryn Horrocks | said | Ready to use | 4 years, 6 months ago |
History
Merryn Horrocks 4 years, 6 months ago
Published this.Merryn Horrocks 4 years, 6 months ago
Gave some feedback: Ready to use
Merryn Horrocks 4 years, 6 months ago
Created this as a copy of Min Spanning Tree.There is only one version of this question that you have access to.
There is one other version that you do not have access to.
Name | Type | Generated Value |
---|
AB | integer |
1
|
||||
AC | integer |
2
|
||||
AE | integer |
6
|
||||
BC | integer |
4
|
||||
BE | integer |
6
|
||||
BF | integer |
6
|
||||
CD | integer |
8
|
||||
CE | integer |
5
|
||||
CF | integer |
3
|
||||
DE | integer |
10
|
||||
DF | integer |
8
|
||||
EF | integer |
1
|
||||
AD | integer |
99
|
||||
AF | integer |
99
|
||||
BD | integer |
99
|
||||
endlist | list |
[ "C", "D", "F" ]
|
||||
endchoice | integer |
0
|
||||
end | string |
C
|
||||
weights | list |
Nested 6×6 list
|
||||
distances | list |
[ 2, 10, 5 ]
|
||||
answer | number |
2
|
||||
distarray | list |
Nested 6×6 list
|
Generated value: integer
- weights
Parts
Use this tab to check that this question works as expected.
Part | Test | Passed? |
---|---|---|
Number entry | ||
Hasn't run yet |
This question is used in the following exam: