Assess students' ability to analyze and compare Dijkstra, Bellman-Ford, and A* on weighted directed graphs: include correctness conditions (nonnegative edges, negative cycles), derivation of time and space complexities for common implementations (adjacency list/matrix, binary/Fibonacci heaps), evaluation of heuristic admissibility and optimality for A*, and selection of the best algorithm given resource and input constraints; may require tracing algorithms on small graphs and explaining path reconstruction and trade-offs.