pub struct NodeIndex<Ix = u32>(_);
Expand description
Node identifier.
Implementations§
Trait Implementations§
source§impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix>where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix>where Ty: EdgeType, Ix: IndexType,
Index the Graph
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>where
Ty: EdgeType,
Ix: IndexType,
impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for Graph<N, E, Ty, Ix>where Ty: EdgeType, Ix: IndexType,
Index the Graph
by NodeIndex
to access node weights.
Panics if the node doesn’t exist.
source§impl<Ix> Ord for NodeIndex<Ix>where
Ix: Ord,
impl<Ix> Ord for NodeIndex<Ix>where Ix: Ord,
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<NodeIndex<Ix>> for NodeIndex<Ix>where
Ix: PartialEq<Ix>,
impl<Ix> PartialEq<NodeIndex<Ix>> for NodeIndex<Ix>where Ix: PartialEq<Ix>,
source§impl<Ix> PartialOrd<NodeIndex<Ix>> for NodeIndex<Ix>where
Ix: PartialOrd<Ix>,
impl<Ix> PartialOrd<NodeIndex<Ix>> for NodeIndex<Ix>where Ix: PartialOrd<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 for NodeIndex<Ix>where Ix: Copy,
impl<Ix> Eq for NodeIndex<Ix>where Ix: Eq,
impl<Ix> GraphIndex for NodeIndex<Ix>where Ix: IndexType,
impl<Ix> StructuralEq for NodeIndex<Ix>
impl<Ix> StructuralPartialEq for NodeIndex<Ix>
Auto Trait Implementations§
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<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.