Struct rs_graph::linkedlistgraph::Edge
source · Expand description
Edge of a linked list graph.
This is basically a newtype of the arc index. Note that
e == g.reverse(e)
.
Trait Implementations
sourceimpl<ID> BiNumberedEdge for Edge<ID>where
ID: PrimInt + Unsigned,
impl<ID> BiNumberedEdge for Edge<ID>where
ID: PrimInt + Unsigned,
sourceimpl<ID> PartialEq<Edge<ID>> for Edge<ID>where
ID: PrimInt + Unsigned,
impl<ID> PartialEq<Edge<ID>> for Edge<ID>where
ID: PrimInt + Unsigned,
impl<ID: Copy> Copy for Edge<ID>where
ID: PrimInt + Unsigned,
impl<ID> Edge for Edge<ID>where
ID: PrimInt + Unsigned,
impl<ID: Eq> Eq for Edge<ID>where
ID: PrimInt + Unsigned,
impl<ID> StructuralEq for Edge<ID>where
ID: PrimInt + Unsigned,
Auto Trait Implementations
impl<ID> RefUnwindSafe for Edge<ID>where
ID: RefUnwindSafe,
impl<ID> Send for Edge<ID>where
ID: Send,
impl<ID> Sync for Edge<ID>where
ID: Sync,
impl<ID> Unpin for Edge<ID>where
ID: Unpin,
impl<ID> UnwindSafe for Edge<ID>where
ID: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more