D1.2.2 - Dijkstra’s algorithm for finding the shortest path

Dijkstra’s algorithm for finding the shortest path.

Use dijkstra’s algorithm for finding the shortest path to connect the rule to the data and decision in the question.

This matters because dijkstra’s algorithm for finding the shortest path determines what can be inferred or chosen; begin with the stated conditions and keep the conclusion tied to the evidence.

Example: apply dijkstra’s algorithm for finding the shortest path to one small, clearly defined case, show the key step or comparison, and explain the result in words.

Boundary: Dijkstra’s algorithm for finding the shortest path is not a universal recommendation. Check the syllabus scope, assumptions, units and the limits of the evidence before generalising.