Struct petgraph::graph::NodeIndex

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

Node identifier.

Methods

impl<Ix: IndexType> NodeIndex<Ix>

fn new(x: usize) -> Self

fn index(self) -> usize

fn end() -> Self

Trait Implementations

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

fn from(ix: Ix) -> Self

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

fn index(&self) -> usize

fn is_node_index() -> bool

Derived Implementations

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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