Struct TraversalGraph

pub struct TraversalGraph { /* private fields */ }

Traversal graph derived from a field under one explicit envelope.

Implementations

impl TraversalGraph

pub fn build( field: &LayeredField, config: &FieldConfig, envelope: &TraversalEnvelope, ) -> Result<Self, LayeredFieldError>

Build the graph from a sampled field.

Support candidates are the lowest crossing in each cell. A candidate survives when the free span above it reaches agent_height and it is still set after the blocking mask is inflated by agent_radius.

pub const fn evidence(&self) -> TraversalEvidence

Geometric facts about the build.

pub fn node(&self, x: usize, y: usize) -> Option<SupportNode>

Support node retained at (x, y), if any.

pub fn connected(&self, from: (usize, usize), to: (usize, usize)) -> bool

Whether two cells lie in the same connected component.

pub fn find_route( &self, from: (usize, usize), to: (usize, usize), ) -> Result<RouteOutcome, LayeredFieldError>

Shortest 3D-length route under the envelope used to build this graph.

Ties are broken by the lower row-major node index, so the returned path is identical across runs and platforms.

Trait Implementations

impl Clone for TraversalGraph

fn clone(&self) -> TraversalGraph

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TraversalGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.