Enum petgraph::data::Element

pub enum Element<N, E> {
    Node {
        weight: N,
    },
    Edge {
        source: usize,
        target: usize,
        weight: E,
    },
}

A graph element.

A sequence of Elements, for example an iterator, is laid out as follows: Nodes are implicitly given the index of their appearance in the sequence. The edges’ source and target fields refer to these indices.

Variants

Node

A graph node.

Fields

weight: N

Edge

A graph edge.

Fields

source: usize

target: usize

weight: E

Trait Implementations

impl<N: Clone, E: Clone> Clone for Element<N, E>

fn clone(&self) -> Element<N, E>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug, E: Debug> Debug for Element<N, E>

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

Formats the value using the given formatter.

impl<N: PartialEq, E: PartialEq> PartialEq for Element<N, E>

fn eq(&self, other: &Element<N, E>) -> 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<N: Eq, E: Eq> Eq for Element<N, E>

impl<N, E> StructuralPartialEq for Element<N, E>