Struct smallgraph::Graph

pub struct Graph<T> {
    pub free: SmallVec<[(usize, usize); 128]>,
    pub nodes: SmallVec<[(usize, Option<T>); 128]>,
    pub connections: SmallVec<[(usize, usize); 256]>,
}

Fields

free: SmallVec<[(usize, usize); 128]>

nodes: SmallVec<[(usize, Option<T>); 128]>

connections: SmallVec<[(usize, usize); 256]>

Methods

impl<T> Graph<T>

pub fn insert(&mut self, value: T) -> (usize, usize)

pub fn directed_connect(
    &mut self,
    parent: (usize, usize),
    child: (usize, usize)
)

pub fn connect(&mut self, a: (usize, usize), b: (usize, usize))

pub fn disconnect(&mut self, n: (usize, usize))

pub fn is_connected(&mut self, a: (usize, usize), b: (usize, usize)) -> bool

pub fn is_directed_connected(
    &mut self,
    parent: (usize, usize),
    child: (usize, usize)
) -> bool

pub fn remove(&mut self, n: (usize, usize)) -> Result<T, GraphError>

pub fn get(&self, n: (usize, usize)) -> Result<&T, GraphError>

pub fn get_mut(&mut self, n: (usize, usize)) -> Result<&mut T, GraphError>