Package de.bsommerfeld.pathetic.engine.pathfinder.heap

package de.bsommerfeld.pathetic.engine.pathfinder.heap

Min-heap contracts for the open set.

MinHeap defines the operations the search needs (insert-or-update with decrease-key semantics, extract-min, membership and cost lookup) and the shared cost validity check; NaN costs are rejected because they would silently break the heap ordering. Siftable and Resizable are implementation-side contracts for sift operations and capacity growth.

Related Packages

Package	Description
de.bsommerfeld.pathetic.engine.pathfinder	The A* implementation.
de.bsommerfeld.pathetic.engine.pathfinder.heap.impl	Array-backed primitive min-heap implementations.
de.bsommerfeld.pathetic.engine.pathfinder.processing	Engine-side implementations of the processor context interfaces.

Interfaces

Class	Description
MinHeap	Contract for min-heap implementations used in pathfinding algorithms.
Resizable	Contract for data structures that can dynamically resize their internal storage.
Siftable	Contract for heap implementations that use sift operations to maintain heap property.