Struct fera_graph::graphs::adjset::UndirectedEdge [] [src]

pub struct UndirectedEdge<V>(_, _);

Trait Implementations

impl<V: Copy> Copy for UndirectedEdge<V>
[src]

impl<V: Clone> Clone for UndirectedEdge<V>
[src]

[src]

Returns a copy of the value. Read more

1.0.0
[src]

Performs copy-assignment from source. Read more

impl<V: Eq> Eq for UndirectedEdge<V>
[src]

impl<V: Debug> Debug for UndirectedEdge<V>
[src]

[src]

Formats the value using the given formatter.

impl<V: PartialEq> PartialEq for UndirectedEdge<V>
[src]

[src]

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0
[src]

This method tests for !=.

impl<V: PartialEq> PartialEq<(V, V)> for UndirectedEdge<V>
[src]

[src]

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0
[src]

This method tests for !=.

impl<V: Ord> PartialOrd for UndirectedEdge<V>
[src]

[src]

This method returns an ordering between self and other values if one exists. Read more

1.0.0
[src]

This method tests less than (for self and other) and is used by the < operator. Read more

1.0.0
[src]

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

1.0.0
[src]

This method tests greater than (for self and other) and is used by the > operator. Read more

1.0.0
[src]

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

impl<V: Ord> Ord for UndirectedEdge<V>
[src]

[src]

This method returns an Ordering between self and other. Read more

1.22.0
[src]

Compares and returns the maximum of two values. Read more

1.22.0
[src]

Compares and returns the minimum of two values. Read more

impl<V: PartialOrd + Hash> Hash for UndirectedEdge<V>
[src]

[src]

Feeds this value into the given [Hasher]. Read more

1.3.0
[src]

Feeds a slice of this type into the given [Hasher]. Read more

impl<V> AdjSetEdge<V> for UndirectedEdge<V> where
    V: AdjSetVertex + PartialOrd
[src]

[src]

[src]

[src]