Struct petgraph::graph::NodeIndex

pub struct NodeIndex<Ix = DefaultIx>(_);

Node identifier.

Methods

impl<Ix: IndexType> NodeIndex<Ix>

pub fn new(x: usize) -> Self

pub fn index(self) -> usize

pub fn end() -> Self

Trait Implementations

impl<Ix> VisitMap<NodeIndex<Ix>> for FixedBitSet where     Ix: IndexType,

fn visit(&mut self, x: NodeIndex<Ix>) -> bool

Mark a as visited.

fn is_visited(&self, x: &NodeIndex<Ix>) -> bool

Return whether a has been visited before.

impl<Ix> Serialize for NodeIndex<Ix> where     Ix: IndexType + Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where     S: Serializer,

Serialize this value into the given Serde serializer.

impl<'de, Ix> Deserialize<'de> for NodeIndex<Ix> where     Ix: IndexType + Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where     D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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.

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

Performs the indexing (container[index]) operation.

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.

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

Performs the mutable indexing (container[index]) operation.

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

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

fn default() -> NodeIndex<Ix>

Returns the "default value" for a type.

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

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

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

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

This method tests for !=.

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

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

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

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

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

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

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

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

fn from(ix: Ix) -> Self

Performs the conversion.

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

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

Formats the value using the given formatter.

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.

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

Performs the indexing (container[index]) operation.

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.

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

Performs the mutable indexing (container[index]) operation.

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

fn index(&self) -> usize

fn is_node_index() -> bool