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> Clone for Edge<ID>where ID: PrimInt + Unsigned + Clone,

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> Debug for Edge<ID>where ID: PrimInt + Unsigned + Debug,

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

Formats the value using the given formatter.

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

type Edge = Edge<ID>

The underlying edge.

fn is_incoming(&self) -> bool

Whether the edge is incoming.

fn edge(&self) -> Self::Edge

The underlying edge.

fn is_outgoing(&self) -> bool

Whether the edge is outgoing.

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

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

fn index(&self) -> usize

impl<ID> PartialEq<Edge<ID>> 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 !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

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

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