[−][src]Struct generic_graph::adjacency_list::elements::DirectedEdge
Methods
impl<K: Hash + Eq + Clone, W: Sum + Eq + Ord + Copy> DirectedEdge<K, W>[src]
pub fn new(left: K, right: K, weight: W) -> DirectedEdge<K, W>[src]
Trait Implementations
impl<K: Clone, W: Clone> Clone for DirectedEdge<K, W> where
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy, [src]
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy,
fn clone(&self) -> DirectedEdge<K, W>[src]
fn clone_from(&mut self, source: &Self)1.0.0[src]
impl<K: Debug, W: Debug> Debug for DirectedEdge<K, W> where
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy, [src]
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy,
impl<K: Hash + Eq + Clone, V, W: Sum + Eq + Ord + Copy> DirectedGraph<SimpleVertex<K, V>, DirectedEdge<K, W>, K, V, W, CompoundKey<K>> for AdjacencyGraph<K, V, W>[src]
fn adjacent(&self, from: &K, to: &K) -> bool[src]
fn neighbors(&self, from: &K) -> Vec<&K>[src]
fn leading_to(&self, to: &K) -> Vec<&K>[src]
fn get_vertex(&self, key: &K) -> Option<&SimpleVertex<K, V>>[src]
fn get_mutable_vertex(&mut self, key: &K) -> Option<&mut SimpleVertex<K, V>>[src]
fn get_edge(&self, pair: (&K, &K)) -> Option<&DirectedEdge<K, W>>[src]
fn get_mutable_edge(
&mut self,
pair: (&K, &K)
) -> Option<&mut DirectedEdge<K, W>>[src]
&mut self,
pair: (&K, &K)
) -> Option<&mut DirectedEdge<K, W>>
impl<K: Hash + Eq + Clone, W: Sum + Eq + Ord + Copy> Edge<K, W, CompoundKey<K>> for DirectedEdge<K, W>[src]
fn get_weight(&self) -> W[src]
fn set_weight(&mut self, weight: W)[src]
fn left(&self) -> &K[src]
fn right(&self) -> &K[src]
fn get_pair(&self) -> (&K, &K)[src]
fn generate_key(pair: (&K, &K)) -> CompoundKey<K>[src]
fn key(&self) -> CompoundKey<K>[src]
impl<K: Eq, W: Eq> Eq for DirectedEdge<K, W> where
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy, [src]
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy,
impl<K: PartialEq, W: PartialEq> PartialEq<DirectedEdge<K, W>> for DirectedEdge<K, W> where
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy, [src]
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy,
fn eq(&self, other: &DirectedEdge<K, W>) -> bool[src]
fn ne(&self, other: &DirectedEdge<K, W>) -> bool[src]
impl<K, W> StructuralEq for DirectedEdge<K, W> where
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy, [src]
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy,
impl<K, W> StructuralPartialEq for DirectedEdge<K, W> where
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy, [src]
K: Hash + Eq + Clone,
W: Sum + Eq + Ord + Copy,
Auto Trait Implementations
impl<K, W> RefUnwindSafe for DirectedEdge<K, W> where
K: RefUnwindSafe,
W: RefUnwindSafe,
K: RefUnwindSafe,
W: RefUnwindSafe,
impl<K, W> Send for DirectedEdge<K, W> where
K: Send,
W: Send,
K: Send,
W: Send,
impl<K, W> Sync for DirectedEdge<K, W> where
K: Sync,
W: Sync,
K: Sync,
W: Sync,
impl<K, W> Unpin for DirectedEdge<K, W> where
K: Unpin,
W: Unpin,
K: Unpin,
W: Unpin,
impl<K, W> UnwindSafe for DirectedEdge<K, W> where
K: UnwindSafe,
W: UnwindSafe,
K: UnwindSafe,
W: UnwindSafe,
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,
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.
fn to_owned(&self) -> T[src]
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.
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>,