Struct PreparedSubgoalGraph 

pub struct PreparedSubgoalGraph { /* private fields */ }

Prepared subgoal graph implementing PreparedGridSearch.

Sparse corner-subgoal abstract search with online A* fallback; correctness-first, not a performance claim for huge maps. Uniform hop cost only.

Implementations

impl PreparedSubgoalGraph

pub fn builder() -> SubgoalGraphBuilder

Returns a SubgoalGraphBuilder for preprocess entry.

pub fn subgoal_count(&self) -> usize

Number of corner subgoals retained after preprocess.

Trait Implementations

impl Clone for PreparedSubgoalGraph

fn clone(&self) -> PreparedSubgoalGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PreparedSubgoalGraph

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

Formats the value using the given formatter.

impl Eq for PreparedSubgoalGraph

impl PartialEq for PreparedSubgoalGraph

fn eq(&self, other: &PreparedSubgoalGraph) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PreparedGridSearch for PreparedSubgoalGraph

fn name(&self) -> &'static str

Stable map identity (usually the builder name).

fn grid(&self) -> &Grid

Grid snapshot used for walkability and costs.

fn metadata(&self) -> &PreprocessedGridMetadata

Build-time summary of shape, walkability counts, and cost model labels.

fn search( &self, request: SearchRequest, ) -> Result<SearchOutcome<Path, SearchStats>, GridSearchError>

Point-to-point search on the prepared snapshot.

impl StructuralPartialEq for PreparedSubgoalGraph