Struct Chordality 

pub struct Chordality {
    pub is_chordal: bool,
    pub fill_in: Vec<(VertexId, VertexId)>,
    pub triangulated: Graph,
}

Result of Graph::is_chordal_with.

Fields

is_chordal: bool

Whether the graph is chordal.

fill_in: Vec<(VertexId, VertexId)>

The fill-in (chordal completion): edges whose addition makes the graph chordal. Empty for chordal graphs; not necessarily minimal.

triangulated: Graph

The triangulated graph: a copy of the original graph (same directedness) with the fill-in edges appended after the original ones.

Trait Implementations

impl Clone for Chordality

fn clone(&self) -> Chordality

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Chordality

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

Formats the value using the given formatter.

impl PartialEq for Chordality

fn eq(&self, other: &Chordality) -> 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 Chordality