pub struct Edge<E, Ix = DefaultIx> {
pub weight: E,
next: [EdgeIndex<Ix>; 2],
node: [NodeIndex<Ix>; 2],
}
Expand description
The graph’s edge type.
Fields§
§weight: E
Associated edge data.
next: [EdgeIndex<Ix>; 2]
Next edge in outgoing and incoming edge lists.
node: [NodeIndex<Ix>; 2]
Start and End node index
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<E, Ix> Freeze for Edge<E, Ix>
impl<E, Ix> RefUnwindSafe for Edge<E, Ix>where
E: RefUnwindSafe,
Ix: RefUnwindSafe,
impl<E, Ix> Send for Edge<E, Ix>
impl<E, Ix> Sync for Edge<E, Ix>
impl<E, Ix> Unpin for Edge<E, Ix>
impl<E, Ix> UnwindSafe for Edge<E, Ix>where
E: UnwindSafe,
Ix: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)