pub struct Node<N, Ix = DefaultIx> {
pub weight: N,
next: [EdgeIndex<Ix>; 2],
}
Expand description
The graph’s node type.
Fields§
§weight: N
Associated node data.
next: [EdgeIndex<Ix>; 2]
Next edge in outgoing and incoming edge lists.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<N, Ix> Freeze for Node<N, Ix>
impl<N, Ix> RefUnwindSafe for Node<N, Ix>where
N: RefUnwindSafe,
Ix: RefUnwindSafe,
impl<N, Ix> Send for Node<N, Ix>
impl<N, Ix> Sync for Node<N, Ix>
impl<N, Ix> Unpin for Node<N, Ix>
impl<N, Ix> UnwindSafe for Node<N, Ix>where
N: 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
)