Expand description
Shortest Path is an experimental library finding the shortest path from A to B
It aims primarily at powering Liquid War 7 but could be of wider use. Who knows.
Re-exports§
pub use mesh::*;
Modules§
- mesh
- mesh_2d
- 2D mesh implementations and utilities for pathfinding on grids.
- mesh_3d
- True 3D mesh implementations for volumetric pathfinding.
- mesh_
25d - 2.5D mesh implementations for layered pathfinding.
- mesh_
source - Mesh reading utilities for loading pathfinding data from various sources.
- mesh_
topo - Dynamic topology for meshes with conditional connectivity.
Structs§
- Gate
- Represents a connection to a neighboring node in the pathfinding graph.
- Gradient
- Stores pathfinding results as a gradient field over a mesh.
Enums§
Constants§
- BUG_
REPORT_ URL - URL to report bugs.
- DISTANCE_
DIAGONAL - Distance for diagonal movement in a grid.
- DISTANCE_
DIAGONAL_ 3D - Distance for 3D diagonal movement across layers.
- DISTANCE_
MAX - Maximum distance value, representing unreachable or uninitialized nodes.
- DISTANCE_
MIN - Minimum distance value, representing zero distance.
- DISTANCE_
STRAIGHT - Distance for orthogonal (straight) movement in a grid.
Functions§
- best_
for_ indexes - Finds the mesh index that minimizes the sum of squared distances to a set of target indices.
- ordered_
indexes - Returns all mesh indexes ordered by their gradient distance, from closest to furthest.
- worst_
for_ indexes - Finds the mesh index that maximizes the sum of squared distances to a set of target indices.
- xy_
to_ closest_ index - Finds the index of the closest walkable cell to the given 2D coordinates.
- xyz_
to_ closest_ index - Finds the index of the closest walkable cell to the given 3D coordinates.