Package com.github.yellowstonegames.path

package com.github.yellowstonegames.path
  • Class
    Description
    Algorithms<V>
    Most of the algorithms that operate on a Graph are defined here, with some specific cases in subclasses.
    AStarSearch
    Performs A* search to find the shortest path between two Coord points.
    Connection<V>
    The most-commonly-used class that represents an edge between nodes on a Graph.
    Connection.DirectedConnection<V>
    A Connection that treats A-to-B as a different edge from B-to-A.
    Connection.UndirectedConnection<V>
    A Connection that treats A-to-B and B-to-A as the same edge.
    CostlyGraph
    A default setting for a DirectedGraph of Coord vertices where each passable cell has a cost to enter it from any passable neighbor.
    DefaultGraph
    A default setting for an UndirectedGraph of Coord vertices where all connections have cost 1.
    DijkstraMap
    A group of pathfinding algorithms that explore in all directions equally, and are commonly used when there is more than one valid goal, or when you want a gradient floodfill to mark each cell in an area with its distance from a goal.
    DirectedGraph<V>
    A kind of Graph where all connections between vertices are one-way (but a connection may exist that goes from A to B and another connection may go from B to A), and each connection can have a different cost.
    DirectedGraphAlgorithms<V>
    Algorithms specific to directed graphs, like CostlyGraph, as well as general Algorithms.
    Edge<V>
    Abstract superclass of any connection between nodes on a graph.
    Graph<V>
    Abstract superclass of actual Graph types.
    Heuristic<V>
    A Heuristic generates estimates of the cost to move from a given node to the goal.
    Node<V>
    An extended version of BinaryHeap.Node that also stores a reference to the parent Graph, a vertex object of type V, a Map of neighbor Nodes to the appropriate Connection per Node, an extra List of those same Connections for faster iteration, and a lot of internal data used by algorithms in this package.
    TwistedLine
    Like DrunkenWalk, this generates orthogonally-connected paths of Coord that meander through an area; unlike DrunkenWalk, this won't ever generate paths that cross themselves.
    UndirectedGraph<V>
    A kind of Graph where all connections between vertices are two-way and have equal cost for traveling A to B or B to A.
    UndirectedGraphAlgorithms<V>
    Algorithms specific to undirected graphs, like DefaultGraph, as well as general Algorithms.
    ZoneOfInfluence
    Calculates the Zone of Influence, also known as Zone of Control, for different points on a map.