As a suggestion, you could colour the paths as you go (as you box a number)? Also, as Dijkstra's method is about finding a path (so no cycles), is it correct to say that you don't need to check any edge that would create a cycle? For example when checking C to B and saying "B is boxed so I won't go there": it could also be said that B to C would create a cycle, so I won't go there?
Kia ora @Sibelius40! It really depends on your school as each internal can be a bit different from school to school, but usually Excellence involves making some modification or addition to the network to optimise an outcome. E.g. removing a path to make the network traversable for a race taking into consideration how the chosen path to remove may impact min/max distance. The other criteria is making sure that you’ve shown and communicated fully how you’ve calculated all 3 main skills, traversability, MST, and shortest path. This is best done through describing the algorithm you’ve used embedding the context of the question in your answer. The best person to ask though is your teacher as like I say each school may have slightly different requirements.
![เกิดใหม่ทั้งทีก็เป็นสไลม์ไปซะแล้ว ซีซั่น 3 - ตอนที่ 67 [ซับไทย]](http://i.ytimg.com/vi/he_uIQ-Xv_Q/mqdefault.jpg)
![[TH] VALORANT Champions Seoul - Lower Bracket Final - LEV vs TH](http://i.ytimg.com/vi/fyYkI80GG4o/mqdefault.jpg)
proper finnicky innit
Find the shortest path vertex F to Vertex A using Dijkstra's algorithm.
amazing video i learned so much 🤩
As a suggestion, you could colour the paths as you go (as you box a number)?
Also, as Dijkstra's method is about finding a path (so no cycles), is it correct to say that you don't need to check any edge that would create a cycle?
For example when checking C to B and saying "B is boxed so I won't go there":
it could also be said that B to C would create a cycle, so I won't go there?
How to get excellence😊
Kia ora @Sibelius40! It really depends on your school as each internal can be a bit different from school to school, but usually Excellence involves making some modification or addition to the network to optimise an outcome. E.g. removing a path to make the network traversable for a race taking into consideration how the chosen path to remove may impact min/max distance. The other criteria is making sure that you’ve shown and communicated fully how you’ve calculated all 3 main skills, traversability, MST, and shortest path. This is best done through describing the algorithm you’ve used embedding the context of the question in your answer. The best person to ask though is your teacher as like I say each school may have slightly different requirements.
I think this is wrong
Can you be a little more specific so I can check?
I think it's correct