Enum EdgeSelector 

pub enum EdgeSelector<'a> {
    All,
    AllOrdered(EdgeOrder),
    None,
    Single(igraph_int_t),
    List(Cow<'a, [igraph_int_t]>),
    Range(igraph_int_t, igraph_int_t),
    Incident {
        vertex: igraph_int_t,
        mode: NeighborMode,
    },
    Pairs {
        pairs: Cow<'a, [(igraph_int_t, igraph_int_t)]>,
        directed: bool,
    },
    Path {
        vertices: Cow<'a, [igraph_int_t]>,
        directed: bool,
    },
    AllBetween {
        from: igraph_int_t,
        to: igraph_int_t,
        directed: bool,
    },
}

A set of edges, see the module docs.

Variants

All

All edges, ordered by id.

AllOrdered(EdgeOrder)

All edges, in the given order.

None

No edge.

Single(igraph_int_t)

A single edge.

List(Cow<'a, [igraph_int_t]>)

The listed edges, in the given order.

Range(igraph_int_t, igraph_int_t)

Edges with id in start..end; like a Rust range it is empty (and selects nothing, whatever the graph) when start >= end.

Incident

Edges incident to a vertex, each loop edge listed once (use Graph::incident_edges to choose how loops are counted).

Fields

vertex: igraph_int_t

The vertex.

mode: NeighborMode

Which incident edges, for directed graphs.

Pairs

The edges connecting the given (from, to) vertex pairs (one per pair).

Fields

pairs: Cow<'a, [(igraph_int_t, igraph_int_t)]>

Endpoint pairs.

directed: bool

Whether to respect edge directions.

Path

The edges along a path given as a vertex sequence.

Fields

vertices: Cow<'a, [igraph_int_t]>

The vertices of the path.

directed: bool

Whether to respect edge directions.

AllBetween

All the (possibly multiple) edges between two vertices.

Fields

from: igraph_int_t

Source vertex.

to: igraph_int_t

Target vertex.

directed: bool

Whether to respect edge directions.

Implementations

impl<'a> EdgeSelector<'a>

pub fn incident(vertex: igraph_int_t, mode: NeighborMode) -> Self

The edges incident to vertex (shorthand for EdgeSelector::Incident).

pub fn pairs(pairs: &'a [(igraph_int_t, igraph_int_t)], directed: bool) -> Self

One edge between each (from, to) pair (shorthand for EdgeSelector::Pairs).

pub fn path(vertices: &'a [igraph_int_t], directed: bool) -> Self

The edges along a vertex path (shorthand for EdgeSelector::Path).

pub fn all_between(from: igraph_int_t, to: igraph_int_t, directed: bool) -> Self

All edges between two vertices (shorthand for EdgeSelector::AllBetween).

impl EdgeSelector<'_>

pub fn to_raw(&self) -> Result<RawEs>

Builds the raw igraph selector (igraph_es_t), for calling raw FFI functions; the safe wrappers of the crate do it for you. Empty ranges select nothing, as for VertexSelector::to_raw.

Errors

Only if igraph fails to build the selector (e.g. out of memory); ids are validated when the selector is used.

Trait Implementations

impl<'a> Clone for EdgeSelector<'a>

fn clone(&self) -> EdgeSelector<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for EdgeSelector<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for EdgeSelector<'a>

impl<'a> From<&'a Vec<i64>> for EdgeSelector<'a>

fn from(e: &'a Vec<igraph_int_t>) -> Self

Converts to this type from the input type.

impl<'a, const N: usize> From<&'a [i64; N]> for EdgeSelector<'a>

fn from(e: &'a [igraph_int_t; N]) -> Self

Converts to this type from the input type.

impl<'a> From<&'a [i64]> for EdgeSelector<'a>

fn from(e: &'a [igraph_int_t]) -> Self

Converts to this type from the input type.

impl<'a> From<&'a igraph_vector_int_t> for EdgeSelector<'a>

fn from(e: &'a VectorInt) -> Self

Converts to this type from the input type.

impl From<Range<i64>> for EdgeSelector<'_>

fn from(r: Range<igraph_int_t>) -> Self

Converts to this type from the input type.

impl From<RangeFull> for EdgeSelector<'_>

fn from(_: RangeFull) -> Self

Converts to this type from the input type.

impl From<RangeInclusive<i64>> for EdgeSelector<'_>

fn from(r: RangeInclusive<igraph_int_t>) -> Self

a..=b selects the edges a, a + 1, ..., b (none if a > b).

impl From<Vec<i64>> for EdgeSelector<'_>

fn from(e: Vec<igraph_int_t>) -> Self

Converts to this type from the input type.

impl From<i64> for EdgeSelector<'_>

fn from(e: igraph_int_t) -> Self

Converts to this type from the input type.

impl<'a> PartialEq for EdgeSelector<'a>

fn eq(&self, other: &EdgeSelector<'a>) -> 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> StructuralPartialEq for EdgeSelector<'a>