Enum GraphComplexity 

pub enum GraphComplexity {
    Trivial,
    Simple,
    Moderate,
    Complex,
}

A qualitative classification of graph complexity.

Variants

Trivial

Very few nodes and edges; trivial to schedule.

Simple

Moderate number of nodes; standard linear pipeline.

Moderate

Many nodes with branching; requires careful scheduling.

Complex

Dense graph with many cross-edges; potentially expensive.

Implementations

impl GraphComplexity

pub fn description(&self) -> &'static str

Returns a human-readable description of the complexity level.

pub fn requires_advanced_scheduling(&self) -> bool

Returns true if the graph may require non-trivial scheduling.

Trait Implementations

impl Clone for GraphComplexity

fn clone(&self) -> GraphComplexity

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphComplexity

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

Formats the value using the given formatter.

impl Eq for GraphComplexity

impl PartialEq for GraphComplexity

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