Properties

Link copied to clipboard

The navigation graph.

Link copied to clipboard
abstract val obstacles: List<W>
Link copied to clipboard

Functions

Link copied to clipboard
Link copied to clipboard
abstract fun addLayer(p0: Molecule, p1: Layer<T, Euclidean2DPosition>)
Link copied to clipboard
abstract fun addNode(p0: Node<T>, p1: Euclidean2DPosition): Boolean
Link copied to clipboard
abstract fun addObstacle(obstacle: W)
Link copied to clipboard
Link copied to clipboard
abstract fun getDimensions(): Int
Link copied to clipboard
abstract fun getDistanceBetweenNodes(p0: Node<T>, p1: Node<T>): Double
Link copied to clipboard
abstract fun getGlobalReactions(): ListSet<GlobalReaction<T>>
Link copied to clipboard
Link copied to clipboard
Link copied to clipboard
abstract fun getLayers(): ListSet<Layer<T, Euclidean2DPosition>>
Link copied to clipboard
Link copied to clipboard
abstract fun getNeighborhood(p0: Node<T>): Neighborhood<T>
Link copied to clipboard
abstract fun getNodeByID(p0: Int): Node<T>
Link copied to clipboard
abstract fun getNodeCount(): Int
Link copied to clipboard
abstract fun getNodes(): ListSet<Node<T>>
Link copied to clipboard
abstract fun getNodesWithinRange(p0: Node<T>, p1: Double): ListSet<Node<T>>
abstract fun getNodesWithinRange(p0: Euclidean2DPosition, p1: Double): ListSet<Node<T>>
Link copied to clipboard
abstract fun getObstaclesInRange(center: Euclidean2DPosition, range: Double): List<W>

Given a point and a range, retrieves all the obstacles within.

abstract fun getObstaclesInRange(centerx: Double, centery: Double, range: Double): List<W>

Given a point and a range, retrieves all the obstacles within. This function is maintained for compatibility with the previous version of the API, and may be deprecated in the future.

Link copied to clipboard
abstract fun getOffset(): DoubleArray
Link copied to clipboard
@Nonnull
abstract fun getPosition(p0: Node<T>): Euclidean2DPosition
Link copied to clipboard
Link copied to clipboard
abstract fun getSize(): DoubleArray
Link copied to clipboard
Link copied to clipboard
abstract fun hasMobileObstacles(): Boolean
Link copied to clipboard
Link copied to clipboard
abstract fun isTerminated(): Boolean
Link copied to clipboard
abstract operator override fun iterator(): MutableIterator<Node<T>>
Link copied to clipboard
abstract fun makePosition(vararg p0: Number): Euclidean2DPosition
abstract fun makePosition(vararg coordinates: Double): Euclidean2DPosition

Creates a new Euclidean2DPosition.

Link copied to clipboard
open fun moveNode(node: Node<T>, direction: Euclidean2DPosition)
Link copied to clipboard
@Nonnull
abstract fun moveNodeToPosition(@Nonnull p0: Node<T>, @Nonnull p1: Euclidean2DPosition)
Link copied to clipboard
Link copied to clipboard
fun <R> Iterable<R>.randomElement(randomGenerator: RandomGenerator): R

Returns a random element of the Iterable using the provided randomGenerator.

Link copied to clipboard
Link copied to clipboard
abstract fun removeNode(p0: Node<T>)
Link copied to clipboard
abstract fun removeObstacle(obstacle: W): Boolean
Link copied to clipboard
Link copied to clipboard
Link copied to clipboard
fun <R> Iterable<R>.shuffled(randomGenerator: RandomGenerator): Iterable<R>

Fisher–Yates shuffle algorithm using a RandomGenerator. More information on Wikipedia.