AQA Decision 1 5.01 Introducing Dijkstra's Algorithm

[Thearkillian]

I used this video for my a level decision exam back in 2018, I now study Computer Science at University and have a Dijkstra's algorithm question in my exam tomorrow. 4 Years later still the best video :) Thanks for getting me all the way to the end TLMaths!

[iammaster]

"ooh look product placement" xD

[TLMaths]

Yes, you have to visit all of the nodes in order to completely solve the problem. A real-life algorithm for GPS route planning of course wouldn't, but in the exam you have to. All vertices should be boxed at the end.

[mariastokes]

Do you have to go through all the nodes on a dijkstras algorithm?

[DatsNastyyy]

When you write a number on the vertices, eg AtoB instead of writing just 4, why don’t you write ‘4A’ to keep track of where you came from to avoid mistakes when working out the pathway 😀

[DRJonesy]

What happens if you go from E to D first instead of G to D first. Would you just write 16 down aswell?

[jiyan]

Or you could put the letters of the nodes that made the numbers. Hope that made sense lol

[umar]

Compared to core1 & core2, do people usually do the best in decision1?

[viralna]

If there are two routes which are equal, do you have to write both routes down in exam?