[−][src]Struct btree_graph::BTreeGraph

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

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,` [src]

`pub fn new() -> Self`[src]

Trait Implementations

`impl<V, E> AddEdge<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone,` [src]

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: V, y: V, e: E ) -> Result<Option<(V, V)>, Self::Error>`[src]

`impl<V, E> AddVertex<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn add_vertex(&mut self, x: V) -> Option<BTreeSet<E>>`[src]

`impl<V, E> Adjacent<V> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`type Error = Error`

`pub fn adjacent(&self, x: V, y: V) -> Result<bool, Self::Error>`[src]

`impl<V: Clone, E: Clone> Clone for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn clone(&self) -> BTreeGraph<V, E>`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0[src]

`impl<V, E> Connections<V> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`type Error = Error`

`pub fn connections(&self, v: V) -> Result<BTreeSet<&V>, Self::Error>`[src]

`impl<V: Debug, E: Debug> Debug for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

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

`impl<V, E> Default for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn default() -> Self`[src]

`impl<V, E> Edges<E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn edges(&self) -> BTreeSet<&E>`[src]

`impl<V: Eq, E: Eq> Eq for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`impl<V, E> GetEdgeValue<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn get_edge_value(&self, e: E) -> Option<&(V, V)>`[src]

`impl<V, E> GetVertexValue<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn get_vertex_value(&self, v: V) -> Option<&BTreeSet<E>>`[src]

`impl<V: PartialEq, E: PartialEq> PartialEq<BTreeGraph<V, E>> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn eq(&self, other: &BTreeGraph<V, E>) -> bool`[src]

`pub fn ne(&self, other: &BTreeGraph<V, E>) -> bool`[src]

`impl<V, E> RemoveEdge<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone,` [src]

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, e: E) -> Result<(), Self::Error>`[src]

`impl<V, E> RemoveVertex<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone,` [src]

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

`type Error = Error`

`pub fn remove_vertex(&mut self, v: V) -> Result<(), Self::Error>`[src]

`impl<V, E> StructuralEq for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`impl<V, E> StructuralPartialEq for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`impl<V, E> Vertices<V> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn vertices(&self) -> BTreeSet<&V>`[src]

Auto Trait Implementations

`impl<V, E> Send for BTreeGraph<V, E> where E: Send, V: Send,` [src]

`impl<V, E> Sync for BTreeGraph<V, E> where E: Sync, V: Sync,` [src]

`impl<V, E> Unpin for BTreeGraph<V, E>`[src]

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

The resulting type after obtaining ownership.

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

[−][src]Struct btree_graph::BTreeGraph

Implementations

impl<V, E> BTreeGraph<V, E> where V: Ord, E: Ord, [src]

pub fn new() -> Self[src]

Trait Implementations

impl<V, E> AddEdge<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone, [src]

type Error = Error

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

impl<V, E> AddVertex<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

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

impl<V, E> Adjacent<V> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

type Error = Error

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

impl<V: Clone, E: Clone> Clone for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

pub fn clone(&self) -> BTreeGraph<V, E>[src]

pub fn clone_from(&mut self, source: &Self)1.0.0[src]

impl<V, E> Connections<V> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

type Error = Error

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

impl<V: Debug, E: Debug> Debug for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

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

impl<V, E> Default for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

pub fn default() -> Self[src]

impl<V, E> Edges<E> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

pub fn edges(&self) -> BTreeSet<&E>[src]

impl<V: Eq, E: Eq> Eq for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

impl<V, E> GetEdgeValue<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

pub fn get_edge_value(&self, e: E) -> Option<&(V, V)>[src]

impl<V, E> GetVertexValue<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

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

impl<V: PartialEq, E: PartialEq> PartialEq<BTreeGraph<V, E>> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

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

pub fn ne(&self, other: &BTreeGraph<V, E>) -> bool[src]

impl<V, E> RemoveEdge<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone, [src]

type Error = Error

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

impl<V, E> RemoveVertex<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone, [src]

type Error = Error

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

impl<V, E> StructuralEq for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

impl<V, E> StructuralPartialEq for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

impl<V, E> Vertices<V> for BTreeGraph<V, E> where V: Ord, E: Ord, [src]

pub fn vertices(&self) -> BTreeSet<&V>[src]

Auto Trait Implementations

impl<V, E> Send for BTreeGraph<V, E> where E: Send, V: Send, [src]

impl<V, E> Sync for BTreeGraph<V, E> where E: Sync, V: Sync, [src]

impl<V, E> Unpin for BTreeGraph<V, E>[src]

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<T> ToOwned for T where T: Clone, [src]

type Owned = T

pub fn to_owned(&self) -> T[src]

pub fn clone_into(&self, target: &mut T)[src]

impl<T, U> TryFrom<U> for T where U: Into<T>, [src]

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]

impl<T, U> TryInto<U> for T where U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

`impl<V, E> BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn new() -> Self`[src]

`impl<V, E> AddEdge<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone,` [src]

`type Error = Error`

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

`impl<V, E> AddVertex<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn add_vertex(&mut self, x: V) -> Option<BTreeSet<E>>`[src]

`impl<V, E> Adjacent<V> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`type Error = Error`

`pub fn adjacent(&self, x: V, y: V) -> Result<bool, Self::Error>`[src]

`impl<V: Clone, E: Clone> Clone for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn clone(&self) -> BTreeGraph<V, E>`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0[src]

`impl<V, E> Connections<V> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`type Error = Error`

`pub fn connections(&self, v: V) -> Result<BTreeSet<&V>, Self::Error>`[src]

`impl<V: Debug, E: Debug> Debug for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

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

`impl<V, E> Default for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn default() -> Self`[src]

`impl<V, E> Edges<E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn edges(&self) -> BTreeSet<&E>`[src]

`impl<V: Eq, E: Eq> Eq for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`impl<V, E> GetEdgeValue<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn get_edge_value(&self, e: E) -> Option<&(V, V)>`[src]

`impl<V, E> GetVertexValue<V, E> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn get_vertex_value(&self, v: V) -> Option<&BTreeSet<E>>`[src]

`impl<V: PartialEq, E: PartialEq> PartialEq<BTreeGraph<V, E>> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn eq(&self, other: &BTreeGraph<V, E>) -> bool`[src]

`pub fn ne(&self, other: &BTreeGraph<V, E>) -> bool`[src]

`impl<V, E> RemoveEdge<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone,` [src]

`type Error = Error`

`pub fn remove_edge(&mut self, e: E) -> Result<(), Self::Error>`[src]

`impl<V, E> RemoveVertex<V, E> for BTreeGraph<V, E> where V: Ord + Clone, E: Ord + Clone,` [src]

`type Error = Error`

`pub fn remove_vertex(&mut self, v: V) -> Result<(), Self::Error>`[src]

`impl<V, E> StructuralEq for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`impl<V, E> StructuralPartialEq for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`impl<V, E> Vertices<V> for BTreeGraph<V, E> where V: Ord, E: Ord,` [src]

`pub fn vertices(&self) -> BTreeSet<&V>`[src]

`impl<V, E> Send for BTreeGraph<V, E> where E: Send, V: Send,` [src]

`impl<V, E> Sync for BTreeGraph<V, E> where E: Sync, V: Sync,` [src]

`impl<V, E> Unpin for BTreeGraph<V, E>`[src]

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into<U> for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom<U> for T where U: Into<T>,` [src]

`type Error = Infallible`

`pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>`[src]

`impl<T, U> TryInto<U> for T where U: TryFrom<T>,` [src]

`type Error = <U as TryFrom<T>>::Error`

`pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>`[src]