[−][src]Struct btree_graph::BTreeGraph
Implementations
impl<V, E> BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
Trait Implementations
impl<V, E> AddEdge<V, E> for BTreeGraph<V, E> where
V: Ord + Clone,
E: Ord + Clone,
[src]
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
pub fn add_edge(
&mut self,
x: V,
y: V,
e: E
) -> Result<Option<(V, V)>, Self::Error>
[src]
&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,
[src]
V: Ord,
E: Ord,
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]
V: Ord,
E: Ord,
impl<V: Clone, E: Clone> Clone for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
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]
V: Ord,
E: Ord,
impl<V: Debug, E: Debug> Debug for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
impl<V, E> Edges<E> for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
impl<V: Eq, E: Eq> Eq for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
impl<V, E> GetEdgeValue<V, E> for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
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]
V: Ord,
E: Ord,
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]
V: Ord,
E: Ord,
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]
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.
pub fn remove_edge(&mut self, e: E) -> Option<(V, V)>
[src]
impl<V, E> RemoveVertex<V, E> for BTreeGraph<V, E> where
V: Ord + Clone,
E: Ord + Clone,
[src]
V: Ord + Clone,
E: Ord + Clone,
When you remove a vertex, you should ensure there are no dangling edges.
pub fn remove_vertex(&mut self, v: V) -> Option<BTreeSet<E>>
[src]
impl<V, E> StructuralEq for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
impl<V, E> StructuralPartialEq for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
impl<V, E> Vertices<V> for BTreeGraph<V, E> where
V: Ord,
E: Ord,
[src]
V: Ord,
E: Ord,
Auto Trait Implementations
impl<V, E> Send for BTreeGraph<V, E> where
E: Send,
V: Send,
[src]
E: Send,
V: Send,
impl<V, E> Sync for BTreeGraph<V, E> where
E: Sync,
V: Sync,
[src]
E: Sync,
V: Sync,
impl<V, E> Unpin for BTreeGraph<V, E>
[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
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<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
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]
U: TryFrom<T>,