Struct calyx_opt::analysis::GraphColoring

pub struct GraphColoring<T> { /* private fields */ }

Defines a greedy graph coloring algorithm over a generic conflict graph.

Implementations

impl<'a, T> GraphColoring<T>where
    T: 'a + Eq + Hash + Clone + Ord,

pub fn insert_conflict(&mut self, a: &T, b: &T)

Add a conflict edge between a and b.

pub fn insert_conflicts<C>(&mut self, items: C)where
    C: Iterator<Item = &'a T> + Clone,

Add conflict edges between all given items.

pub fn has_nodes(&self) -> bool

pub fn get_share_freqs(&mut self) -> HashMap<i64, i64>

provides a hashmap that gives the sharing frequencies

pub fn color_greedy(
    &mut self,
    bound: Option<i64>,
    keep_self_color: bool
) -> HashMap<T, T>

Given an ordering of Ts, find a mapping from nodes to Ts such that no node has a neighbor with the same T. keep_self_color indicates whether to keep the mapping of the node to itself in the returned HashMap (since nodes are “colors”)

pub fn welsh_powell_coloring(&self) -> HashMap<T, T>

Trait Implementations

impl<T, C> From<C> for GraphColoring<T>where
    T: Hash + Eq + Ord,
    C: Iterator<Item = T>,

fn from(nodes: C) -> Self

Converts to this type from the input type.

impl<T: Eq + Hash + ToString + Clone + Ord> ToString for GraphColoring<T>

fn to_string(&self) -> String

Converts the given value to a String.