Package ch.awae.utils.pathfinding

General Path-Finding library.

See: Description

Interface Summary

Interface	Description
GraphDataProvider<T>
Pathfinder<V>	Base Interface for pathfinding algorithm implementations
Vertex<T extends Vertex<T>>	Base interface for pathfinding graph vertices

Class Summary

Class	Description
AStarPathfinder<V>	Path Finder based on the A-Star algorithm.
DijkstraPathfinder<V>	Pathfinder based on the Dijkstra algorithm.
PathfindingResult<T>
VertexPathfinder<T extends Vertex<T>>

Enum Summary

Enum	Description
PathfindingResult.TYPE

Package ch.awae.utils.pathfinding Description

General Path-Finding library. The path finding operates on vertices, where each vertex knows all its reachable neighbours and the distance to these neighbours. The path finding algorithms can then walk through these links as required. Since awaeUtils 1.0.2 vertices may also provide n-dimensional spatial information for heuristics-based path finders (e.g. A*). Currently only a few implementations are provided, custom implementations can however be written as needed. Provided are:

• Dijkstra
• A-Star (using cartesian spatial coordinates as heuristic)

Since:

awaeUtils 1.0.0

Author:

Andreas Wälchli