Struct CycleAnalysis 

pub struct CycleAnalysis {
    pub has_cycles: bool,
    pub girth: Option<usize>,
    pub cycle_rank: usize,
    pub is_tree: bool,
    pub num_components: usize,
}

Summary of the cycle structure in a factor graph.

Fields

has_cycles: bool

True if the graph contains at least one cycle.

girth: Option<usize>

Approximate girth (length of shortest cycle), or None for trees/forests.

cycle_rank: usize

Number of independent cycles (cycle rank = |E| - |V| + c).

is_tree: bool

Whether the graph is a tree (connected and acyclic).

num_components: usize

Number of connected components.

Trait Implementations

impl Clone for CycleAnalysis

fn clone(&self) -> CycleAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CycleAnalysis

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for CycleAnalysis

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for CycleAnalysis

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

where __S: Serializer,

Serialize this value into the given Serde serializer.