Struct FilteredEdge 

pub struct FilteredEdge<G> {
    pub grade: G,
    pub edge: BareEdge,
}

An edge with its associated critical grade.

Fields

grade: G

The critical grade of this edge.

edge: BareEdge

The endpoints of this edge.

Trait Implementations

impl<G: Clone> Clone for FilteredEdge<G>

fn clone(&self) -> FilteredEdge<G>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<G: Debug> Debug for FilteredEdge<G>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<G: Display> Display for FilteredEdge<G>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<G> Edge for FilteredEdge<G>

fn u(&self) -> usize

First endpoint. This is an undirected edge, but the first endpoint must be consistent for a fixed instance.

fn u_mut(&mut self) -> &mut usize

Returns a mutable reference to the first endpoint.

fn v(&self) -> usize

Second endpoint. This is an undirected edge, but the second endpoint must be consistent for a fixed instance.

fn v_mut(&mut self) -> &mut usize

Returns a mutable reference to the second endpoint.

fn max(&self) -> usize

The greatest endpoint.

fn min(&self) -> usize

The least endpoint.

fn minmax(&self) -> (usize, usize)

Return a pair whose first element is the greatest endpoint, and the second is the least endpoint.

impl<G> From<FilteredEdge<G>> for BareEdge

fn from(e: FilteredEdge<G>) -> Self

Converts to this type from the input type.

impl<G: Hash> Hash for FilteredEdge<G>

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<G: Ord> Ord for FilteredEdge<G>

Implements a lexicographic ordering. First lexicographically compare the grades, and resolve ties by comparing edges.

fn cmp(&self, other: &Self) -> 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<G: PartialEq> PartialEq for FilteredEdge<G>

fn eq(&self, other: &FilteredEdge<G>) -> 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<G: Ord> PartialOrd for FilteredEdge<G>

Implements a total ordering, same as .cmp().

fn partial_cmp(&self, other: &Self) -> 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<G: Copy> Copy for FilteredEdge<G>

impl<G: Eq> Eq for FilteredEdge<G>

impl<G> StructuralPartialEq for FilteredEdge<G>