Struct LabelPropagationReport 

pub struct LabelPropagationReport { /* private fields */ }

Observable label-propagation results for declarative graph input.

Examples

use whitaker_common::test_support::decomposition::{
    EdgeInput, label_propagation_report,
};

let report = label_propagation_report(
    &["gamma", "alpha", "beta"],
    &[EdgeInput {
        left: 0,
        right: 1,
        weight: 5,
    }],
    1,
)
.expect("valid input");

assert_eq!(report.labels().len(), 3);

Implementations

impl LabelPropagationReport

pub fn labels(&self) -> &[usize]

Returns the final label vector.

pub fn label_of(&self, node: usize) -> Option<usize>

Returns the propagated label for node, or None if it is out of range.

pub fn iteration_count(&self) -> usize

Returns the number of propagation passes performed.

pub fn has_active_nodes(&self) -> bool

Returns true when the graph contains at least one active node.

pub fn all_labels_in_bounds(&self) -> bool

Returns true when every label is a valid node index.

Trait Implementations

impl Clone for LabelPropagationReport

fn clone(&self) -> LabelPropagationReport

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LabelPropagationReport

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

Formats the value using the given formatter.

impl Eq for LabelPropagationReport

impl PartialEq for LabelPropagationReport

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LabelPropagationReport