Struct ConnectivityGraph

pub struct ConnectivityGraph { /* private fields */ }

Complete topology over a declared source-qualified object universe.

Implementations

impl ConnectivityGraph

pub fn try_new( nodes: impl IntoIterator<Item = ObjectId>, connections: impl IntoIterator<Item = VerifiedConnection>, coverage: CompleteTopologyEvidence, ) -> Result<Self, TopologyError>

Constructs a graph, rejecting ambiguous nodes and partial connection endpoints.

pub fn coverage(&self) -> &CompleteTopologyEvidence

Evidence proving that the graph is a complete projection for its declared scope.

pub fn reachable_from( &self, origin: &ObjectId, minimum_clear_width_metres: f64, ) -> Result<Vec<ObjectId>, TopologyError>

Returns every node reachable through edges meeting the clear-width threshold.

pub fn route( &self, origin: &ObjectId, destination: &ObjectId, minimum_clear_width_metres: f64, ) -> Result<RouteOutcome, TopologyError>

Finds the deterministic shortest-hop route meeting the clear-width threshold.

Trait Implementations

impl Clone for ConnectivityGraph

fn clone(&self) -> ConnectivityGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ConnectivityGraph

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

Formats the value using the given formatter.

impl PartialEq for ConnectivityGraph

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for ConnectivityGraph