Immersive learning
VR 360 presentation will use this question view when WebXR is available.
Choose a topic
Pick a topic to continue learning.
Choose a format
How would you like to work through it?
Change subject
Choose a subject and topic
Your current selection will stay unchanged until you confirm.
A shortest-path implementation repeatedly finalizes the unsettled vertex with the smallest tentative distance, as in Dijkstra's algorithm. Which condition is required for this greedy finalization to be correct?
Assessment complete
Test review
Explanations
Answer explanation