Struct SymmetricEdge 

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

For undirected graphs

Symmetric edges uses ver_a for the vertice with the littler id and ver_b for the one with the bigger, this is only used to facilitate retrieving and modifying values on a graph

Implementations

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

pub fn new(a: Vertice<T>, b: Vertice<T>) -> Self

Trait Implementations

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

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

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

fn distance(&self) -> &usize

fn is_loop(&self) -> bool

impl<T> Graph<T, SymmetricEdge<T>> for SimpleGraph<T>

where T: Eq + PartialOrd + Hash + Debug,

fn edges(&self) -> &HashSet<SymmetricEdge<T>>

fn vertices(&self) -> &HashSet<Vertice<T>>

fn add_vertice(&mut self, vertice: Vertice<T>)

impl<T: Hash + PartialOrd + Debug> Hash for SymmetricEdge<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 SymmetricEdge<T>

fn eq(&self, other: &SymmetricEdge<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 SymmetricEdge<T>

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