Uses of Interface
de.bsommerfeld.pathetic.engine.pathfinder.heap.MinHeap

Packages that use MinHeap

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

Uses of MinHeap in de.bsommerfeld.pathetic.engine.pathfinder

Methods in de.bsommerfeld.pathetic.engine.pathfinder with parameters of type MinHeap

Modifier and Type	Method	Description
protected abstract Node	AbstractPathfinder.extractBestNode(MinHeap openSet)	Extracts the node with the lowest cost from the open set and retrieves the corresponding Node object.
protected Node	AStarPathfinder.extractBestNode(MinHeap openSet)
protected abstract void	AbstractPathfinder.insertStartNode(Node node, double fCost, MinHeap openSet)	Inserts the start node into the open set and updates any internal mapping.
protected void	AStarPathfinder.insertStartNode(Node node, double fCost, MinHeap openSet)
protected abstract void	AbstractPathfinder.processSuccessors(PathPosition requestStart, PathPosition requestTarget, Node currentNode, MinHeap openSet, SearchContext searchContext)	Abstract method representing the core logic of processing successor nodes for a given currentNode.
protected void	AStarPathfinder.processSuccessors(PathPosition start, PathPosition target, Node currentNode, MinHeap openSet, SearchContext searchContext)	Processes the successors of the current node, checking if they're in the open or closed set, calculating costs, validating traversability, and updating the open set as needed.

Uses of MinHeap in de.bsommerfeld.pathetic.engine.pathfinder.heap.impl

Classes in de.bsommerfeld.pathetic.engine.pathfinder.heap.impl that implement MinHeap

Modifier and Type	Class	Description
class	PrimitiveMinHeap	A highly optimized, array-backed binary min-heap for A* pathfinding.
class	QuaternaryPrimitiveMinHeap	A quaternary (4-ary) min-heap implementation optimized for pathfinding algorithms.