Struct rs_graph::linkedlistgraph::Edge [−][src]
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> DirectedEdge for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID> DirectedEdge for Edge<ID> where
ID: PrimInt + Unsigned,
[src]type Edge = Self
The underlying edge.
fn is_incoming(&self) -> bool
[src]
fn edge(&self) -> Self::Edge
[src]
fn is_outgoing(&self) -> bool
[src]
impl<ID> StructuralEq for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID> StructuralEq for Edge<ID> where
ID: PrimInt + Unsigned,
[src]Auto Trait Implementations
impl<ID> RefUnwindSafe for Edge<ID> where
ID: RefUnwindSafe,
impl<ID> RefUnwindSafe for Edge<ID> where
ID: RefUnwindSafe,
impl<ID> UnwindSafe for Edge<ID> where
ID: UnwindSafe,
impl<ID> UnwindSafe for Edge<ID> where
ID: UnwindSafe,