Struct ContinuousShortestPathMap 

pub struct ContinuousShortestPathMap;

Visibility-graph builder for source-rooted continuous shortest-path maps.

Preprocess: nodes = {source} ∪ obstacle vertices; undirected walkable edges with Euclidean cost; multi-target Dijkstra from the source. Query: minimize dist[node] + dist(node, goal) over nodes visible to the goal.

Trait Implementations

impl Clone for ContinuousShortestPathMap

fn clone(&self) -> ContinuousShortestPathMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ContinuousShortestPathMap

impl Debug for ContinuousShortestPathMap

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

Formats the value using the given formatter.

impl Default for ContinuousShortestPathMap

fn default() -> ContinuousShortestPathMap

Returns the “default value” for a type.

impl PolygonShortestPathMapBuilder for ContinuousShortestPathMap

type Map = PreparedContinuousShortestPathMap

Prepared map type produced by this builder.

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

Stable builder identity (usually matches the prepared map name).

fn preprocess( &self, scene: &PolygonScene, source: Point2, ) -> Result<Self::Map, PolygonShortestPathMapBuildError>

Build a map rooted at source for repeated goal queries on scene.