Struct petgraph::graph::NodeIndex [] [src]

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

Node identifier.

Methods

impl<Ix: IndexType> NodeIndex<Ix>
[src]

[src]

[src]

[src]

Trait Implementations

impl<Ix> VisitMap<NodeIndex<Ix>> for FixedBitSet where
    Ix: IndexType
[src]

[src]

Mark a as visited. Read more

[src]

Return whether a has been visited before.

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

Index the StableGraph by NodeIndex to access node weights.

Panics if the node doesn't exist.

The returned type after indexing.

[src]

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
[src]

Index the StableGraph by NodeIndex to access node weights.

Panics if the node doesn't exist.

[src]

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

impl<Ix: Copy> Copy for NodeIndex<Ix>
[src]

impl<Ix: Clone> Clone for NodeIndex<Ix>
[src]

[src]

Returns a copy of the value. Read more

1.0.0
[src]

Performs copy-assignment from source. Read more

impl<Ix: Default> Default for NodeIndex<Ix>
[src]

[src]

Returns the "default value" for a type. Read more

impl<Ix: PartialEq> PartialEq for NodeIndex<Ix>
[src]

[src]

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

[src]

This method tests for !=.

impl<Ix: PartialOrd> PartialOrd for NodeIndex<Ix>
[src]

[src]

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

[src]

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

[src]

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

[src]

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

[src]

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

impl<Ix: Eq> Eq for NodeIndex<Ix>
[src]

impl<Ix: Ord> Ord for NodeIndex<Ix>
[src]

[src]

This method returns an Ordering between self and other. Read more

1.21.0
[src]

Compares and returns the maximum of two values. Read more

1.21.0
[src]

Compares and returns the minimum of two values. Read more

impl<Ix: Hash> Hash for NodeIndex<Ix>
[src]

[src]

Feeds this value into the given [Hasher]. Read more

1.3.0
[src]

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

impl<Ix: IndexType> From<Ix> for NodeIndex<Ix>
[src]

[src]

Performs the conversion.

impl<Ix: Debug> Debug for NodeIndex<Ix>
[src]

[src]

Formats the value using the given formatter. Read more

impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType
[src]

Index the Graph by NodeIndex to access node weights.

Panics if the node doesn't exist.

The returned type after indexing.

[src]

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
[src]

Index the Graph by NodeIndex to access node weights.

Panics if the node doesn't exist.

[src]

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

impl<Ix: IndexType> GraphIndex for NodeIndex<Ix>
[src]

[src]

[src]