Struct FleetGraph 

pub struct FleetGraph { /* private fields */ }

Fleet topology graph. Nodes are devices, edges are communication links. Constraints propagate along edges. Holonomy (cycle consistency) verified on every cycle.

Implementations

impl FleetGraph

pub fn new() -> Self

pub fn add_node(&mut self, node: Node)

pub fn add_edge(&mut self, edge: Edge)

pub fn find_cycles(&self) -> Vec<Vec<String>>

Find all cycles using Johnson’s algorithm (simplified DFS-based approach).

pub fn betti1(&self) -> usize

Compute Betti number β₁ = |E| - |V| + c

pub fn find_path(&self, from: &str, to: &str) -> Option<Vec<String>>

Find path between two nodes (BFS)

pub fn neighbors(&self, node_id: &str) -> Vec<&Node>

Get neighbors of a node

pub fn constraint_reach(&self, constraint_id: &str) -> Vec<&Node>

Constraint propagation: find all devices that should know about a constraint

pub fn is_connected(&self) -> bool

Check if graph is connected

pub fn nodes(&self) -> &[Node]

Get reference to nodes

pub fn edges(&self) -> &[Edge]

Get reference to edges

Trait Implementations

impl Clone for FleetGraph

fn clone(&self) -> FleetGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FleetGraph

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

Formats the value using the given formatter.

impl Default for FleetGraph

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for FleetGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for FleetGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.