Struct Edge 

pub struct Edge<K, N, E>(pub Node<K, N, E>, pub Node<K, N, E>, pub E)
where
    K: Clone + Hash + PartialEq + Eq + Display,
    N: Clone,
    E: Clone;

An edge between nodes is a tuple struct Edge(u, v, e) where u is the source node, v is the target node, and e is the edge’s value.

Tuple Fields

0: Node<K, N, E>

1: Node<K, N, E>

2: E

Implementations

impl<K, N, E> Edge<K, N, E>

where K: Clone + Hash + PartialEq + Eq + Display, N: Clone, E: Clone,

pub fn source(&self) -> &Node<K, N, E>

Returns the source node of the edge.

pub fn target(&self) -> &Node<K, N, E>

Returns the target node of the edge.

pub fn value(&self) -> &E

Returns the edge’s value.

pub fn reverse(&self) -> Edge<K, N, E>

Reverse the edge’s direction.

Trait Implementations

impl<K, N, E> Clone for Edge<K, N, E>

where K: Clone + Hash + PartialEq + Eq + Display + Clone, N: Clone + Clone, E: Clone + Clone,

fn clone(&self) -> Edge<K, N, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, N, E> Ord for Edge<K, N, E>

where K: Clone + Hash + PartialEq + Eq + Display, N: Clone, E: Clone + Ord,

fn cmp(&self, other: &Edge<K, N, E>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<K, N, E> PartialEq for Edge<K, N, E>

where K: Clone + Hash + PartialEq + Eq + Display, N: Clone, E: Clone + Ord,

fn eq(&self, other: &Edge<K, N, 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<K, N, E> PartialOrd for Edge<K, N, E>

where K: Clone + Hash + PartialEq + Eq + Display, N: Clone, E: Clone + Ord,

fn partial_cmp(&self, other: &Edge<K, N, E>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<K, N, E> Eq for Edge<K, N, E>

where K: Clone + Hash + PartialEq + Eq + Display, N: Clone, E: Clone + Ord,