pub struct NodeIndex<Ix = DefaultIx>(/* private fields */);
Expand description
Node identifier.
Implementations§
Trait Implementations§
source§impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix>
impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix>
Index the Graph
by NodeIndex
to access node weights.
Panics if the node doesn’t exist.
source§impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> Index<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>
impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> Index<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>
Index the MatrixGraph
by NodeIndex
to access node weights.
Panics if the node doesn’t exist.
source§impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
Index the StableGraph
by NodeIndex
to access node weights.
Panics if the node doesn’t exist.
source§impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for Graph<N, E, Ty, Ix>
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for Graph<N, E, Ty, Ix>
Index the Graph
by NodeIndex
to access node weights.
Panics if the node doesn’t exist.
source§impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IndexMut<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>
impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IndexMut<NodeIndex<Ix>> for MatrixGraph<N, E, Ty, Null, Ix>
Index the MatrixGraph
by NodeIndex
to access node weights.
Panics if the node doesn’t exist.
source§impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
Index the StableGraph
by NodeIndex
to access node weights.
Panics if the node doesn’t exist.
source§impl<Ix: Ord> Ord for NodeIndex<Ix>
impl<Ix: Ord> Ord for NodeIndex<Ix>
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<Ix: PartialEq> PartialEq for NodeIndex<Ix>
impl<Ix: PartialEq> PartialEq for NodeIndex<Ix>
source§impl<Ix: PartialOrd> PartialOrd for NodeIndex<Ix>
impl<Ix: PartialOrd> PartialOrd for NodeIndex<Ix>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl<Ix: Copy> Copy for NodeIndex<Ix>
impl<Ix: Eq> Eq for NodeIndex<Ix>
impl<Ix: IndexType> GraphIndex for NodeIndex<Ix>
impl<Ix> StructuralPartialEq for NodeIndex<Ix>
Auto Trait Implementations§
impl<Ix> Freeze for NodeIndex<Ix>where
Ix: Freeze,
impl<Ix> RefUnwindSafe for NodeIndex<Ix>where
Ix: RefUnwindSafe,
impl<Ix> Send for NodeIndex<Ix>where
Ix: Send,
impl<Ix> Sync for NodeIndex<Ix>where
Ix: Sync,
impl<Ix> Unpin for NodeIndex<Ix>where
Ix: Unpin,
impl<Ix> UnwindSafe for NodeIndex<Ix>where
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: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
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
)source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.