Skip to main content

Crate dijkstra3d_core

Crate dijkstra3d_core 

Source
Expand description

dijkstra3d-core: pure-Rust port of seung-lab/dijkstra3d and the kimimaro dijkstra_invalidation.hpp voxel-graph algorithms.

This crate is platform-agnostic and contains no Python bindings. The Python-facing wrapper lives in the sibling dijkstra3d-py crate.

§Upstream provenance

Compatibility kernels are derived from the upstream C++ headers, while exact transforms, parallel execution, and workspace reuse include package-specific extensions. These pinned revisions define the compatibility targets:

Re-exports§

pub use error::Dijkstra3dError;
pub use error::Result;
pub use neighborhood::Connectivity;
pub use voxel::VolumeShape;

Modules§

atomic_dist
Atomic distance primitives for parallel SSSP/Dijkstra-style algorithms.
connectivity_graph
The 26-bit-per-voxel connectivity graph.
dijkstra
Single-source single-target shortest path.
distance
Cumulative edge-weight distance field.
edf
Anisotropic Euclidean (chamfer) distance field.
error
Error types for the core crate.
invalidation
Voxel-volume invalidation routines used by TEASAR-style skeletonization.
metrics
Deterministic work counters for the integer graph kernels.
neighborhood
6 / 18 / 26 connectivity neighbor offsets, masks, and weights.
parental
Parental field and path reconstruction.
perf_pool
Best-effort P-core-aware rayon thread pools for the batch engine (opt-in).
queue
Priority-queue abstraction.
railroad
Shortest last-mile path to a zero-cost rail network.
voxel
Volume shape utilities and the VoxelSource trait.
workspace
Reusable scratch state for repeated point-to-point Dijkstra queries on the same volume.