Module 6 · Dijkstra's Algorithm (optional)
Lesson 6-5 · Three Planners, One Harness — Knowledge ChecksAnswer key
Where does the slow-edge list live in the class version, and why?
A class keeps its data with the methods that use it. The blocked list moved inside BFS in Lesson 5-5 for the same reason; the slow list follows it.
Why must BFS have an add_slow_edge() method that does nothing?
The harness is written against the shape. A planner that cannot use a piece of information still has to accept it, or the harness would need an if for every class — which is exactly what polymorphism avoids.