ConceptTheory & Algos
Landmark heuristic
A method to precompute shortest paths from vertices to a chosen landmark to define potential functions for goal-directed search.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.