Struct BTreeGraph 

pub struct BTreeGraph<V, E>
where
    V: Ord,
    E: Ord,
{ /* private fields */ }

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

Implementations

impl<V, E> BTreeGraph<V, E>

where V: Ord, E: Ord,

pub fn new() -> Self

Trait Implementations

impl<V, E> AddEdge<V, E> for BTreeGraph<V, E>

where V: Ord + Clone, E: Ord + Clone,

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

type Error = Error

fn add_edge(&mut self, x: V, y: V, e: E) -> Result<Option<(V, V)>, Self::Error>

impl<V, E> AddVertex<V, E> for BTreeGraph<V, E>

where V: Ord, E: Ord,

fn add_vertex(&mut self, x: V) -> Option<BTreeSet<E>>

impl<V, E> Adjacent<V> for BTreeGraph<V, E>

where V: Ord, E: Ord,

type Error = Error

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

impl<V, E> Clone for BTreeGraph<V, E>

where V: Ord + Clone, E: Ord + Clone,

fn clone(&self) -> BTreeGraph<V, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V, E> Connections<V> for BTreeGraph<V, E>

where V: Ord, E: Ord,

type Error = Error

fn connections(&self, v: V) -> Result<BTreeSet<&V>, Self::Error>

impl<V, E> Debug for BTreeGraph<V, E>

where V: Ord + Debug, E: Ord + Debug,

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

Formats the value using the given formatter.

impl<V, E> Default for BTreeGraph<V, E>

where V: Ord, E: Ord,

fn default() -> Self

Returns the “default value” for a type.

impl<V, E> Edges<E> for BTreeGraph<V, E>

where V: Ord, E: Ord,

fn edges(&self) -> BTreeSet<&E>

impl<V, E> GetEdgeValue<V, E> for BTreeGraph<V, E>

where V: Ord, E: Ord,

fn get_edge_value(&self, e: E) -> Option<&(V, V)>

impl<V, E> GetVertexValue<V, E> for BTreeGraph<V, E>

where V: Ord, E: Ord,

fn get_vertex_value(&self, v: V) -> Option<&BTreeSet<E>>

impl<V, E> PartialEq for BTreeGraph<V, E>

where V: Ord + PartialEq, E: Ord + PartialEq,

fn eq(&self, other: &BTreeGraph<V, E>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<V, E> RemoveEdge<V, E> for BTreeGraph<V, E>

where V: Ord + Clone, E: 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

fn remove_edge(&mut self, e: E) -> Result<(), Self::Error>

impl<V, E> RemoveVertex<V, E> for BTreeGraph<V, E>

where V: Ord + Clone, E: Ord + Clone,

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

type Error = Error

fn remove_vertex(&mut self, v: V) -> Result<(), Self::Error>

impl<V, E> Vertices<V> for BTreeGraph<V, E>

where V: Ord, E: Ord,

fn vertices(&self) -> BTreeSet<&V>

impl<V, E> Eq for BTreeGraph<V, E>

where V: Ord + Eq, E: Ord + Eq,

impl<V, E> StructuralPartialEq for BTreeGraph<V, E>

where V: Ord, E: Ord,