ConceptTheory & Algos
Goal-directed search
Goal-directed search modifies edge weights using potential functions to steer Dijkstra's algorithm downhill towards the target, thereby pruning the search without altering asymptotic complexity.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.