Struct petgraph::graph::NodeIndex

source ·
pub struct NodeIndex<Ix = DefaultIx>(/* private fields */);
Expand description

Node identifier.

Implementations§

source§

impl<Ix: IndexType> NodeIndex<Ix>

source

pub fn new(x: usize) -> Self

source

pub fn index(self) -> usize

source

pub fn end() -> Self

Trait Implementations§

source§

impl<Ix: Clone> Clone for NodeIndex<Ix>

source§

fn clone(&self) -> NodeIndex<Ix>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<Ix: Debug> Debug for NodeIndex<Ix>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<Ix: Default> Default for NodeIndex<Ix>

source§

fn default() -> NodeIndex<Ix>

Returns the “default value” for a type. Read more
source§

impl<Ix: IndexType> From<Ix> for NodeIndex<Ix>

source§

fn from(ix: Ix) -> Self

Converts to this type from the input type.
source§

impl<Ix: Hash> Hash for NodeIndex<Ix>

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

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.

§

type Output = N

The returned type after indexing.
source§

fn index(&self, index: NodeIndex<Ix>) -> &N

Performs the indexing (container[index]) operation. Read more
source§

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.

§

type Output = N

The returned type after indexing.
source§

fn index(&self, ax: NodeIndex<Ix>) -> &N

Performs the indexing (container[index]) operation. Read more
source§

impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

Index the StableGraph by NodeIndex to access node weights.

Panics if the node doesn’t exist.

§

type Output = N

The returned type after indexing.
source§

fn index(&self, index: NodeIndex<Ix>) -> &N

Performs the indexing (container[index]) operation. Read more
source§

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§

fn index_mut(&mut self, index: NodeIndex<Ix>) -> &mut N

Performs the mutable indexing (container[index]) operation. Read more
source§

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§

fn index_mut(&mut self, ax: NodeIndex<Ix>) -> &mut N

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for StableGraph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

Index the StableGraph by NodeIndex to access node weights.

Panics if the node doesn’t exist.

source§

fn index_mut(&mut self, index: NodeIndex<Ix>) -> &mut N

Performs the mutable indexing (container[index]) operation. Read more
source§

impl<Ix: IndexType> IndexType for NodeIndex<Ix>

source§

fn index(&self) -> usize

source§

fn new(x: usize) -> Self

source§

fn max() -> Self

source§

impl<Ix: Ord> Ord for NodeIndex<Ix>

source§

fn cmp(&self, other: &NodeIndex<Ix>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl<Ix: PartialEq> PartialEq for NodeIndex<Ix>

source§

fn eq(&self, other: &NodeIndex<Ix>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<Ix: PartialOrd> PartialOrd for NodeIndex<Ix>

source§

fn partial_cmp(&self, other: &NodeIndex<Ix>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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 more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl<Ix: Copy> Copy for NodeIndex<Ix>

source§

impl<Ix: Eq> Eq for NodeIndex<Ix>

source§

impl<Ix: IndexType> GraphIndex for NodeIndex<Ix>

source§

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> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Copy,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

default unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<Q, K> Comparable<K> for Q
where Q: Ord + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn compare(&self, key: &K) -> Ordering

Compare self to key and return their ordering.
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<Ix> NodeRef for Ix
where Ix: IndexType,

§

type NodeId = Ix

§

type Weight = ()

source§

fn id(&self) -> <Ix as NodeRef>::NodeId

source§

fn weight(&self) -> &<Ix as NodeRef>::Weight

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<N> NodeTrait for N
where N: Copy + Ord + Hash,