Module 6 · Dijkstra's Algorithm (optional)
Lesson 6-2 · Weights in the Graph — Knowledge Checks
Name Date
SLOW_EDGES holds ((0, 1), (0, 2), 5). What do weight((0, 2), (0, 1)) and weight((1, 1), (1, 2)) return?
Answer Why?
Why does path_cost() need the position parameter, when the path is right there?
Answer Why?
BFS passes every Module 5 property on the slow grid and fails only the cost check. What does that tell you?
Answer Why?