Trait librsnek::compiler::graph::Graph

pub trait Graph {
    type Node: Node + ?Sized + Serialize;
    fn count(&self) -> usize;
    fn add_node(&self, _: Self::Node);
    fn get_node(&self, _: usize) -> Box<Self::Node>;
}

Minimal graph trait that only requires access to the count() of all

Associated Types

type Node: Node + ?Sized + Serialize

Required Methods

fn count(&self) -> usize

The number of nodes in the Graph.

fn add_node(&self, _: Self::Node)

Insert a node into the graph when it already defines its id and the id of its

fn get_node(&self, _: usize) -> Box<Self::Node>

Get a node by id.

Implementors

• impl<T> Graph for DiGraph<T> where
    T: Node + Clone + Serialize,