Process one tile-to-search, fetching all neighbors not yet touched and adding those that fulfill the predicate to the reached set and to the yet-to-be-processed set.

size

fun size(): Int

stepToEnd

fun stepToEnd()

Process fully until there's nowhere left to check

stepUntilDestination

fun stepUntilDestination(destination: TileInfo): BFS

Process until either destination is reached or there's nowhere left to check

toString

open fun toString(): String

Properties

maxSize

var maxSize: Int

Maximum number of tiles to search

predicate

private val predicate: (TileInfo) -> Boolean

startingPoint

val startingPoint: TileInfo

tilesReached

private val tilesReached: HashMap<TileInfo, TileInfo>

each tile reached points to its parent tile, where we got to it from

tilesToCheck

private val tilesToCheck: ArrayDeque<TileInfo>

remaining tiles to check

Sources

jvm source