pub struct Edge<N = String, V = i64>where
N: Node,{ /* private fields */ }
Implementations§
Trait Implementations§
Source§impl<N, V> Contain<Edge<N, V>> for DirectedGraph<N, V>
impl<N, V> Contain<Edge<N, V>> for DirectedGraph<N, V>
Source§fn contains(&self, elem: &Edge<N, V>) -> bool
fn contains(&self, elem: &Edge<N, V>) -> bool
Contain::contains returns true if the given element is in the Contain instance
Source§fn contains_all(&self, iter: impl IntoIterator<Item = T>) -> bool
fn contains_all(&self, iter: impl IntoIterator<Item = T>) -> bool
Contain::contains_all returns true if all elements in the given iterator are in the Contain instance
Source§fn contains_some(&self, iter: impl IntoIterator<Item = T>) -> bool
fn contains_some(&self, iter: impl IntoIterator<Item = T>) -> bool
Contain::contains_some returns true if any element in the given iterator is in the Contain instance
Source§impl<N, V> Contain<Edge<N, V>> for UndirectedGraph<N, V>
impl<N, V> Contain<Edge<N, V>> for UndirectedGraph<N, V>
Source§fn contains(&self, elem: &Edge<N, V>) -> bool
fn contains(&self, elem: &Edge<N, V>) -> bool
Contain::contains returns true if the given element is in the Contain instance
Source§fn contains_all(&self, iter: impl IntoIterator<Item = T>) -> bool
fn contains_all(&self, iter: impl IntoIterator<Item = T>) -> bool
Contain::contains_all returns true if all elements in the given iterator are in the Contain instance
Source§fn contains_some(&self, iter: impl IntoIterator<Item = T>) -> bool
fn contains_some(&self, iter: impl IntoIterator<Item = T>) -> bool
Contain::contains_some returns true if any element in the given iterator is in the Contain instance
Source§impl<'de, N, V> Deserialize<'de> for Edge<N, V>
impl<'de, N, V> Deserialize<'de> for Edge<N, V>
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<N, V: Ord> Ord for Edge<N, V>
impl<N, V: Ord> Ord for Edge<N, V>
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl<N, V: PartialOrd> PartialOrd for Edge<N, V>where
N: Node + PartialOrd,
impl<N, V: PartialOrd> PartialOrd for Edge<N, V>where
N: Node + PartialOrd,
impl<N, V: Eq> Eq for Edge<N, V>
impl<N, V> StructuralPartialEq for Edge<N, V>where
N: Node,
Auto Trait Implementations§
impl<N, V> Freeze for Edge<N, V>
impl<N, V> RefUnwindSafe for Edge<N, V>where
V: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, V> Send for Edge<N, V>
impl<N, V> Sync for Edge<N, V>
impl<N, V> Unpin for Edge<N, V>
impl<N, V> UnwindSafe for Edge<N, V>where
V: UnwindSafe,
N: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more