Struct Edge 

pub struct Edge<E> {
    pub weight: E,
    /* private fields */
}

The graph’s edge type. Unlike graphs, nodes and edges in hypergraphs are symmetric, in that multiple nodes can belong to the same edge and multiple edges can be incident on the same node.

Fields

weight: E

Implementations

impl<E> Edge<E>

pub fn connects(&self, a: usize, b: usize) -> bool

A simple function to check if the edge connects two nodes.

Trait Implementations

impl<E: Clone> Clone for Edge<E>

fn clone(&self) -> Edge<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Debug> Debug for Edge<E>

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

Formats the value using the given formatter.

impl<E: Eq> Eq for Edge<E>

impl<E: Hash> Hash for Edge<E>

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<E: PartialEq> PartialEq for Edge<E>

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