Struct petgraph::graph::EdgeIndex

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

Edge identifier.

Methods

impl<Ix: IndexType> EdgeIndex<Ix>

fn new(x: usize) -> Self

fn index(self) -> usize

fn end() -> Self

An invalid EdgeIndex used to denote absence of an edge, for example to end an adjacency list.

Trait Implementations

impl<Ix: IndexType> Debug for EdgeIndex<Ix>

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

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

fn index(&self) -> usize

fn is_node_index() -> bool

Derived Implementations

impl<Ix: Hash> Hash for EdgeIndex<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 EdgeIndex<Ix>

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

impl<Ix: Eq> Eq for EdgeIndex<Ix>

impl<Ix: PartialOrd> PartialOrd for EdgeIndex<Ix>

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

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

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

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

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

impl<Ix: PartialEq> PartialEq for EdgeIndex<Ix>

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

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

impl<Ix: Clone> Clone for EdgeIndex<Ix>

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

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

impl<Ix: Copy> Copy for EdgeIndex<Ix>