Dijkstra and shortest paths · 2 of 4
Dijkstra
Find the distances from one source when no weight is negative by settling the closest vertex with a min-heap, and adapt the method to another measure of a path, to extra state and to counting shortest paths.
0 of 8 solved
Difficulty: how hard each problem is if its topic is new to you.
- Very EasyRelated to the lesson, but quick to solve even before reading it.
- EasyQuick once you know the topic; approachable right after the lesson.
- NormalNeeds a bit more thinking.
- HardCan take a long time to find the approach.
- Very HardChallenges strong solvers; often needs several observations beyond the lesson.
- InsaneHarder than a reasonable contest at this level would ask; leave it for later.
