dijkstra3d-core
dijkstra3d-core provides Rust implementations of voxel-grid shortest paths,
distance fields, parental fields, Euclidean distance fields, and rolling-ball
invalidation. It is the Rust engine used by the dijkstra3d-rs Python package.
Version 0.1.0 is the initial pre-1.0 release. The crate is versioned with the
Python distribution but published separately; until the registry artifact
exists, consume it from a pinned release commit or a path dependency. Public
APIs may change in a future minor release.
The crate uses x-fastest linear indexing:
index = x + y * sx + z * sx * sy
Example
use dijkstra_unidirectional_slice_int;
use ;
let shape = try_new?;
let field = vec!;
let source = shape.linear;
let target = shape.linear;
let path = dijkstra_unidirectional_slice_int?;
assert_eq!;
assert_eq!;
# Ok::
Input contract
- Construct shapes with
VolumeShape::try_newwhen dimensions are not already trusted.VolumeShape::newis a convenience constructor that panics for an empty or unrepresentable shape. - Slice lengths and source/target indices are checked by the public algorithms.
- Unsigned-integer kernels reject accumulated-distance bounds that cannot be represented safely before allocating their queues.
- Signed and floating-point cost fields must contain finite, non-negative values. Callers are responsible for validating this precondition.
The minimum supported Rust version is 1.85. The crate is licensed under
GPL-3.0-or-later; see THIRD_PARTY_NOTICES.md for upstream provenance and
attribution.
APIs hidden from rustdoc are diagnostic implementation hooks and are not part of the documented compatibility surface.