Assess students' ability to apply Dijkstra's algorithm using priority queues to compute shortest paths in weighted directed graphs with non‑negative edge weights. Tasks include designing or implementing the algorithm with adjacency lists, selecting a priority-queue approach (binary heap vs. decrease-key or lazy update), reconstructing paths, handling disconnected vertices, tracing example graphs, and analyzing correctness and time complexity and implementation trade-offs.