Struct hypergraph::HyperedgeKey [−][src]
pub struct HyperedgeKey<HE> { /* fields omitted */ }
Expand description
A HyperedgeKey is a representation of both the vertices and the weight of a hyperedge, used as a key in the hyperedges set. In a non-simple hypergraph, since the same vertices can be shared by different hyperedges, the weight is also included in the key to keep it unique.
Trait Implementations
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
Auto Trait Implementations
impl<HE> RefUnwindSafe for HyperedgeKey<HE> where
HE: RefUnwindSafe,
impl<HE> Send for HyperedgeKey<HE> where
HE: Send,
impl<HE> Sync for HyperedgeKey<HE> where
HE: Sync,
impl<HE> Unpin for HyperedgeKey<HE> where
HE: Unpin,
impl<HE> UnwindSafe for HyperedgeKey<HE> where
HE: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Compare self to key
and return true
if they are equal.