I was doing the June 2015 D1 paper and was wondering why can we repeat nodes in the algorithm for 3.C
It says find the route but the answer in the mark scheme repeats a node, but I thought a route by definition could not repeat nodes.
D1 Dijkstra - Can we repeat nodes? watch
- Thread Starter
- 13-06-2016 22:23
- Official Rep
- 15-06-2016 23:40
Sorry you've not had any responses about this. Are you sure you've posted in the right place? Here's a link to our subject forum which should help get you more responses if you post there.
You can also find the Exam Thread list for A-levels here and GCSE here.
Just quoting in Puddles the Monkey so she can move the thread if needed
Spoiler:Show(Original post by Puddles the Monkey)
- Study Helper
- 16-06-2016 11:17
Part c is using Dijkstra's algorithm twice: Once when going from A to E, and once when going from E to J. There can be overlap between the two parts, but within each part a node only appears once, at most.