Struct btree_network::BTreeNetwork

pub struct BTreeNetwork<T> where
    T: Ord,  { /* fields omitted */ }

BTreeNetwork is an implementation of a network (abstract data structure) which utilizes BTreeMap for the edge and vertex adjacency lists.

Implementations

impl<T> BTreeNetwork<T> where
    T: Ord, 

pub fn new() -> Self

Trait Implementations

impl<T> AddEdge<T> for BTreeNetwork<T> where
    T: Ord + Clone, 

When you add an edge, you should make sure that the x, and y vertices exist.

type Error = Error

pub fn add_edge(&mut self, x: T, y: T) -> Result<(), Self::Error>

impl<T> AddVertex<T> for BTreeNetwork<T> where
    T: Ord, 

pub fn add_vertex(&mut self, x: T) -> Option<BTreeSet<T>>

impl<T> Adjacent<T> for BTreeNetwork<T> where
    T: Ord, 

type Error = Error

pub fn adjacent(&self, x: T, y: T) -> Result<bool, Self::Error>

impl<T: Clone> Clone for BTreeNetwork<T> where
    T: Ord, 

pub fn clone(&self) -> BTreeNetwork<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Connections<T> for BTreeNetwork<T> where
    T: Ord, 

pub fn connections(&self, x: T) -> Option<&BTreeSet<T>>

impl<T: Debug> Debug for BTreeNetwork<T> where
    T: Ord, 

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

Formats the value using the given formatter.

impl<T> Default for BTreeNetwork<T> where
    T: Ord, 

pub fn default() -> Self

Returns the "default value" for a type.

impl<T: Eq> Eq for BTreeNetwork<T> where
    T: Ord, 

impl<T> GetVertexValue<T> for BTreeNetwork<T> where
    T: Ord, 

pub fn get_vertex_value(&self, v: T) -> Option<&BTreeSet<T>>

impl<T: PartialEq> PartialEq<BTreeNetwork<T>> for BTreeNetwork<T> where
    T: Ord, 

pub fn eq(&self, other: &BTreeNetwork<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &BTreeNetwork<T>) -> bool

This method tests for !=.

impl<T> RemoveEdge<T> for BTreeNetwork<T> where
    T: Ord + Clone, 

When an edge is removed, you should find the incident vertex and ensure the edge is removed from the vertex's adjacency list.

type Error = Error

pub fn remove_edge(&mut self, x: T, y: T) -> Result<(), Self::Error>

impl<T> RemoveVertex<T> for BTreeNetwork<T> where
    T: Ord + Clone, 

When you remove a vertex, you should ensure there are no dangling edges.

type Error = Error

pub fn remove_vertex(&mut self, x: T) -> Result<(), Self::Error>

impl<T> StructuralEq for BTreeNetwork<T> where
    T: Ord, 

impl<T> StructuralPartialEq for BTreeNetwork<T> where
    T: Ord, 

impl<T> Vertices<T> for BTreeNetwork<T> where
    T: Ord, 

pub fn vertices(&self) -> BTreeSet<&T>