Concept

Dijkstra — where it appears

The algorithm that finds the cheapest route to every place by expanding outward in order of cost. It is exact for non-negative costs and it measures the best path made of the steps it was given, so on a lattice its answer carries the lattice's own anisotropy.

Named by 2 essays across one field — each of them below, with the objects they name alongside it.

Also named here as wavefront — the same set of essays touches all of them, so they are one junction rather than several.

Named alongside it

The objects these essays reach for when they reach for this one.

AnisotropyCostFlowIsochronePurposeReach setVerificationWavefrontGeodesicGreat circleMetricPartition

All concepts