Package ai.path

package ai.path
  • Class
    Description
    Map<Position>
    A Map describes the complete state of a finite graph and offers a start and target node to be processed by a pathfinding algorithm.
    Node<Position>
    A Node describes a single node of a finite graph and does knows all paths to its neighbors.
    Path<Position>
    Describes a path from one node to another with a fixed path cost value.
    Pathfinding
    This class contains currently 2 pathfinding methods: - a-star (A*) - dijkstra
    ResultPath<Position>
    The result of a pathfinding algorithm containing a full path from start to target.