Namespace MLEM.Pathfinding
Classes
- AStar2
A 2-dimensional implementation of AStar<T> that uses Microsoft.Xna.Framework.Point for positions, and the manhattan distance as its heuristic.
- AStar3
A 3-dimensional implementation of AStar<T> that uses Microsoft.Xna.Framework.Vector3 for positions, and the manhattan distance as its heuristic.
- AStar<T>
This is an abstract implementation of the A* path finding algorithm. This implementation is used by AStar2, a 2-dimensional A* path finding algorithm, and AStar3, a 3-dimensional A* path finding algorithm.
- PathPoint<T>
A point in a AStar<T> path
Delegates
- AStar<T>.CollectAdditionalNeighbors
A delegate that determines a set of additional
neighborsto be considered for a givenposition.
- AStar<T>.GetCost
A cost function for a given pair of neighboring path finding positions. If a path point should have the default cost, DefaultCost should be returned. If a path point should be unreachable, PositiveInfinity or MaxValue should be returned.