Heuristic<T>.zero constructor

const Heuristic<T>.zero()

Returns a heuristic that always returns 0.0.

This is a valid heuristic guaranteed to find the optimal path, but may be significantly slower than other heuristics, as it becomes equivalent to Dijkstra's algorithm (expanding all nodes as the heuristic does not guide the search).

Implementation

const factory Heuristic.zero() = _ZeroHeuristic<T>;