IB skill practice

Apply Dijkstra tentative labels

Update shortest-path tentative labels using edge weights.

Paper 1, Paper 2 5 marks Difficulty 5

Apply Dijkstra tentative labels - depth scenario

Check the modelling or algorithm condition first. A wildlife survey has current tentative label 27 for vertex C. A route through B has label 8 and edge weight 6. Find the updated tentative label for C. Enter the requested value and choose the interpretation that matches the result.

AI writing feedback

How would you answer this question in your own words? The AI will analyse your response and give feedback on reasoning, evidence, and expression.

Login required
0 words