Not documented.

Enums

DiagonalMovement

A rule value that changes how the Grid.getNeighbors method decides which nodes are neighbors.

Classes

AStarFinder

An implementation of the A* pathfinding algorithm.

DijkstraFinder

An implementation Dijkstra's pathfinding algorithm.

Finder

Root class that all path finding algorithm implementations must subclass.

Graph

Root class that all graphs must subclass in order to work with a Finder.

Grid

A convinience implementation of a square lattice graph.

Node

PointNode

UndirectedPointGraph

An undirected graph where each node is tied to a Point.