KHexagon/io.github.offlinebrain.khexagon.algorythm

Package-level declarations

Types

data class AccessibilityTrie<T : AxisPoint>(val origin: T, val maxMoveCost: Int, val neighbors: (T) -> List<T>, val isWalkable: (T) -> Boolean, val heuristic: (T, T) -> Int, val movementCost: (T, T) -> Double)

A data class that implements a pathfinding algorithm on a graph represented by points of type T extending AxisPoint.

interface Heuristic<T>

Provides an interface to calculate the heuristic value to a certain location.

Provides an interface to calculate the movement cost to a certain location.

Represents a path tile with generic type T.

A provider for pre-computed tries for the line of sight (LoS) on a symmetric grid.

data class TrieNode(val parent: TrieNode? = null, val q: Int, val r: Int, val childrenIndices: MutableList<Int?> = MutableList(10) { null })

Data class defining a trie node for the SymmetricPreComputedVisionTries.

interface Walkable

Provides an interface to determine if a path is walkable.

fun <T : PathTile<T>> aStar(from: T, to: T, neighbors: (T) -> List<T>): List<T>

fun <T : AxisPoint> aStar(from: T, to: T, neighbors: (T) -> List<T>, isWalkable: (T) -> Boolean, heuristic: (T, T) -> Int, movementCost: (T, T) -> Double): List<T>

Applies the A* pathfinding algorithm on a given graph to find the shortest path from the start point from to the destination to.