| Interface | Description |
|---|---|
| Connection<N> |
A connection between two nodes of the
Graph. |
| Graph<N> |
A graph is a collection of nodes, each one having a collection of outgoing
connections. |
| GraphPath<N> |
A
GraphPath represents a path in a Graph. |
| Heuristic<N> |
A
Heuristic generates estimates of the cost to move from a given node to the goal. |
| HierarchicalGraph<N> |
A
HierarchicalGraph is a multilevel graph that can be traversed by a HierarchicalPathFinder at any level of its
hierarchy. |
| PathFinder<N> | |
| SmoothableGraphPath<N,V extends com.badlogic.gdx.math.Vector<V>> |
A path that can be smoothed by a
PathSmoother. |
| Class | Description |
|---|---|
| DefaultConnection<N> |
A
DefaultConnection is a Connection whose cost is 1. |
| DefaultGraphPath<N> |
Default implementation of a
GraphPath that uses an internal Array to store nodes or connections. |
| HierarchicalPathFinder<N> |
A
HierarchicalPathFinder can find a path in an arbitrary HierarchicalGraph using the given PathFinder,
known as level path finder, on each level of the hierarchy. |
| PathFinderQueue<N> | |
| PathFinderRequest<N> |
A request for interruptible pathfinding that should be sent to a
PathFinderQueue through a Telegram. |
| PathFinderRequestControl<N> |
A
PathFinderRequestControl manages execution and resume of any interruptible PathFinderRequest. |
| PathSmoother<N,V extends com.badlogic.gdx.math.Vector<V>> |
A
PathSmoother takes a SmoothableGraphPath and transforms it by linking directly the nodes that are in line of
sight. |
| PathSmootherRequest<N,V extends com.badlogic.gdx.math.Vector<V>> |
A request for interruptible path smoothing.
|