Enum GreedyColoringHeuristic 

pub enum GreedyColoringHeuristic {
    ColoredNeighbors,
    DSatur,
}

Heuristic ordering strategy for vertex_coloring_greedy.

Variants

ColoredNeighbors

Choose the uncolored vertex with the most already-colored neighbors. Faster but typically uses more colors than DSATUR.

DSatur

Choose the uncolored vertex with the highest saturation degree (number of distinct colors among neighbors), breaking ties by degree in the uncolored subgraph. Generally produces better (fewer-color) results.

Trait Implementations

impl Clone for GreedyColoringHeuristic

fn clone(&self) -> GreedyColoringHeuristic

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GreedyColoringHeuristic

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

Formats the value using the given formatter.

impl PartialEq for GreedyColoringHeuristic

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

impl Eq for GreedyColoringHeuristic

impl StructuralPartialEq for GreedyColoringHeuristic