Struct AsymmetricEdge 

pub struct AsymmetricEdge<T: PartialOrd + Debug> { /* private fields */ }

For directed graphs

Asymmetric edges uses ver_a for the from-vertice and ver_b for the to-vertice.

Because this edges are one-way, paths can only be build from ver_a to ver_b

Implementations

impl<T: PartialOrd + Debug> AsymmetricEdge<T>

pub fn new(from: Vertice<T>, to: Vertice<T>) -> Self

pub fn with_distance(distance: usize, from: Vertice<T>, to: Vertice<T>) -> Self

Trait Implementations

impl<T: PartialOrd + Debug> Edge<T> for AsymmetricEdge<T>

fn ver_a(&self) -> &Vertice<T>

fn ver_b(&self) -> &Vertice<T>

fn distance(&self) -> &usize

fn is_loop(&self) -> bool

impl<T: Hash + PartialOrd + Debug> Hash for AsymmetricEdge<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq + PartialOrd + Debug> PartialEq for AsymmetricEdge<T>

fn eq(&self, other: &AsymmetricEdge<T>) -> 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<T: Eq + PartialOrd + Debug> Eq for AsymmetricEdge<T>

impl<T: PartialOrd + Debug> StructuralPartialEq for AsymmetricEdge<T>