Struct petgraph::graph::EdgeReference

pub struct EdgeReference<'a, E: 'a, Ix = DefaultIx> {
    index: EdgeIndex<Ix>,
    node: [NodeIndex<Ix>; 2],
    weight: &'a E,
}

Reference to a Graph edge.

Fields

index: EdgeIndex<Ix>

node: [NodeIndex<Ix>; 2]

weight: &'a E

Implementations

impl<'a, Ix, E> EdgeReference<'a, E, Ix>

where Ix: IndexType,

pub fn weight(&self) -> &'a E

Access the edge’s weight.

NOTE that this method offers a longer lifetime than the trait (unfortunately they don’t match yet).

Trait Implementations

impl<'a, E, Ix: IndexType> Clone for EdgeReference<'a, E, Ix>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, E: Debug + 'a, Ix: Debug> Debug for EdgeReference<'a, E, Ix>

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

Formats the value using the given formatter.

impl<'a, Ix, E> EdgeRef for EdgeReference<'a, E, Ix>

where Ix: IndexType,

type NodeId = NodeIndex<Ix>

type EdgeId = EdgeIndex<Ix>

type Weight = E

fn source(&self) -> Self::NodeId

The source node of the edge.

fn target(&self) -> Self::NodeId

The target node of the edge.

fn weight(&self) -> &E

A reference to the weight of the edge.

fn id(&self) -> Self::EdgeId

The edge’s identifier.

impl<'a, E, Ix: IndexType> PartialEq for EdgeReference<'a, E, Ix>

where E: PartialEq,

fn eq(&self, rhs: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, E, Ix: IndexType> Copy for EdgeReference<'a, E, Ix>