Expand description
Contains classic A* (A-star) path finding algorithms.
A* is one of fastest graph search algorithms, it is used to construct shortest possible path from vertex to vertex. In vast majority of games it is used in pair with navigation meshes (navmesh). Check navmesh module docs for more info.
Structs§
- Graph
- A collection of GraphVertices for pathfinding.
- Graph
Vertex - A default graph vertex with no additional data.
- Partial
Path - A partially complete path containing the indices of graph vertices and its A* scores
- Vertex
Data - Graph vertex that contains position in world and list of indices of neighbour vertices.
Enums§
- Path
Error - Path search can be interrupted by errors, this enum stores all possible kinds of errors.
- Path
Kind - Shows path status.
Traits§
- Vertex
Data Provider - A trait, that describes and arbitrary vertex that could be used in a graph. It allows you to use your structure to store additional info in the graph.