Struct rs_graph::linkedlistgraph::Edge

pub struct Edge<ID = u32>(_)
 where
    ID: PrimInt + Unsigned;

Edge of a linked list graph.

This is basically a newtype of the arc index. Note that e == g.reverse(e).

Trait Implementations

impl<ID: Eq> Eq for Edge<ID> where
    ID: PrimInt + Unsigned, 

impl<ID: Clone> Clone for Edge<ID> where
    ID: PrimInt + Unsigned, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<ID: Copy> Copy for Edge<ID> where
    ID: PrimInt + Unsigned, 

impl<ID: Debug> Debug for Edge<ID> where
    ID: PrimInt + Unsigned, 

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<ID> PartialEq for Edge<ID> where
    ID: PrimInt + Unsigned, 

fn eq(&self, other: &Self) -> bool

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<ID> Edge for Edge<ID> where
    ID: PrimInt + Unsigned, 

impl<ID> Display for Edge<ID> where
    ID: PrimInt + Unsigned + Display, 

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

Formats the value using the given formatter.

impl<ID> Hash for Edge<ID> where
    ID: PrimInt + Unsigned + Hash, 

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, 

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

impl<ID> NumberedEdge for Edge<ID> where
    ID: PrimInt + Unsigned, 

fn index(&self) -> usize

impl<ID> BiNumberedEdge for Edge<ID> where
    ID: PrimInt + Unsigned, 

fn biindex(&self) -> usize