Struct petgraph::graph::EdgeIndex
[−]
[src]
pub struct EdgeIndex<Ix = DefaultIx>(_);
Edge identifier.
Methods
impl<Ix: IndexType> EdgeIndex<Ix>
[src]
pub fn new(x: usize) -> Self
[src]
pub fn index(self) -> usize
[src]
pub fn end() -> Self
[src]
An invalid EdgeIndex
used to denote absence of an edge, for example
to end an adjacency list.
Trait Implementations
impl<Ix> VisitMap<EdgeIndex<Ix>> for FixedBitSet where
Ix: IndexType,
[src]
Ix: IndexType,
fn visit(&mut self, x: EdgeIndex<Ix>) -> bool
[src]
Mark a
as visited. Read more
fn is_visited(&self, x: &EdgeIndex<Ix>) -> bool
[src]
Return whether a
has been visited before.
impl<N, E, Ty, Ix> Index<EdgeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the StableGraph
by EdgeIndex
to access edge weights.
Panics if the edge doesn't exist.
type Output = E
The returned type after indexing.
fn index(&self, index: EdgeIndex<Ix>) -> &E
[src]
Performs the indexing (container[index]
) operation.
impl<N, E, Ty, Ix> IndexMut<EdgeIndex<Ix>> for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the StableGraph
by EdgeIndex
to access edge weights.
Panics if the edge doesn't exist.
fn index_mut(&mut self, index: EdgeIndex<Ix>) -> &mut E
[src]
Performs the mutable indexing (container[index]
) operation.
impl<Ix: Copy> Copy for EdgeIndex<Ix>
[src]
impl<Ix: Clone> Clone for EdgeIndex<Ix>
[src]
fn clone(&self) -> EdgeIndex<Ix>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<Ix: Default> Default for EdgeIndex<Ix>
[src]
impl<Ix: PartialEq> PartialEq for EdgeIndex<Ix>
[src]
fn eq(&self, __arg_0: &EdgeIndex<Ix>) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &EdgeIndex<Ix>) -> bool
[src]
This method tests for !=
.
impl<Ix: PartialOrd> PartialOrd for EdgeIndex<Ix>
[src]
fn partial_cmp(&self, __arg_0: &EdgeIndex<Ix>) -> Option<Ordering>
[src]
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, __arg_0: &EdgeIndex<Ix>) -> bool
[src]
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, __arg_0: &EdgeIndex<Ix>) -> bool
[src]
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, __arg_0: &EdgeIndex<Ix>) -> bool
[src]
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, __arg_0: &EdgeIndex<Ix>) -> bool
[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 EdgeIndex<Ix>
[src]
impl<Ix: Ord> Ord for EdgeIndex<Ix>
[src]
fn cmp(&self, __arg_0: &EdgeIndex<Ix>) -> Ordering
[src]
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more
impl<Ix: Hash> Hash for EdgeIndex<Ix>
[src]
fn hash<__HIx: Hasher>(&self, __arg_0: &mut __HIx)
[src]
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<Ix: Debug> Debug for EdgeIndex<Ix>
[src]
fn fmt(&self, f: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more
impl<N, E, Ty, Ix> Index<EdgeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the Graph
by EdgeIndex
to access edge weights.
Panics if the edge doesn't exist.
type Output = E
The returned type after indexing.
fn index(&self, index: EdgeIndex<Ix>) -> &E
[src]
Performs the indexing (container[index]
) operation.
impl<N, E, Ty, Ix> IndexMut<EdgeIndex<Ix>> for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
Index the Graph
by EdgeIndex
to access edge weights.
Panics if the edge doesn't exist.
fn index_mut(&mut self, index: EdgeIndex<Ix>) -> &mut E
[src]
Performs the mutable indexing (container[index]
) operation.