Assess students' ability to apply Dijkstra's algorithm using a priority queue (min-heap) to compute shortest paths in weighted graphs with nonnegative edge weights. Tasks should include: executing the algorithm step-by-step on a small sample graph (showing priority queue state, distance updates, and path reconstruction), explaining how decrease-key or equivalent operations are handled, identifying unreachable nodes, and analyzing time and space complexity for adjacency list implementations. Emphasize correctness, tie-breaking decisions, and common implementation pitfalls.