Struct SmallGraph 

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

Implementations

impl<T> SmallGraph<T>

pub fn new() -> SmallGraph<T>

Create a new SmallGraph

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

Insert a value into graph

pub fn connect_to(&mut self, parent: NodeHandle, child: NodeHandle)

Create a directed connection between parent and child

pub fn neighbors(&self, node: NodeHandle) -> SmallVec<[NodeHandle; 8]>

Get nodes this node has an edge to

pub fn nodes_with_neighbor(&self, node: NodeHandle) -> SmallVec<[NodeHandle; 8]>

Get nodes that have an edge that can reach node

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

Create a two way connection between two nodes

pub fn disconnect_all(&mut self, n: NodeHandle)

Disconnect all connections a node has

pub fn disconnect(&mut self, a: NodeHandle, b: NodeHandle)

Disconnect all connections between two nodes

pub fn disconnect_from(&mut self, source: NodeHandle, destination: NodeHandle)

Disconnect edge connection between source and destination

pub fn is_connected_to( &mut self, source: NodeHandle, destination: NodeHandle, ) -> bool

Determine if there is a connection connection between a source and destination node

pub fn remove(&mut self, n: NodeHandle) -> Option<T>

Remove a node and it’s connections from graph

pub fn node_count(&self) -> usize

Returns the count of nodes

pub fn get(&self, n: NodeHandle) -> Option<&T>

Get the value of a node

pub fn get_mut(&mut self, n: NodeHandle) -> Option<&mut T>

Get a mutable value of a node