Uses of Interface
de.bsommerfeld.pathetic.engine.pathfinder.heap.MinHeap
Packages that use MinHeap
Package
Description
-
Uses of MinHeap in de.bsommerfeld.pathetic.engine.pathfinder
Methods in de.bsommerfeld.pathetic.engine.pathfinder with parameters of type MinHeapModifier and TypeMethodDescriptionprotected abstract NodeAbstractPathfinder.extractBestNode(MinHeap openSet) Extracts the node with the lowest cost from the open set and retrieves the corresponding Node object.protected NodeAStarPathfinder.extractBestNode(MinHeap openSet) protected abstract voidAbstractPathfinder.insertStartNode(Node node, double fCost, MinHeap openSet) Inserts the start node into the open set and updates any internal mapping.protected voidAStarPathfinder.insertStartNode(Node node, double fCost, MinHeap openSet) protected abstract voidAbstractPathfinder.processSuccessors(PathPosition requestStart, PathPosition requestTarget, Node currentNode, MinHeap openSet, SearchContext searchContext) Abstract method representing the core logic of processing successor nodes for a givencurrentNode.protected voidAStarPathfinder.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 MinHeapModifier and TypeClassDescriptionclassA highly optimized, array-backed binary min-heap for A* pathfinding.classA quaternary (4-ary) min-heap implementation optimized for pathfinding algorithms.