Struct graph_types::DynamicEdge

pub struct DynamicEdge {
    pub bidi: EdgeDirection,
    pub from: usize,
    pub goto: usize,
}

DynamicEdge represents an bidirectional edge between two nodes.

Also known as an arc.

Examples

use graph_theory::GraphEngine;

Fields

bidi: EdgeDirection

The direction of the edge.

from: usize

The index of the node that the edge is coming from.

goto: usize

The index of the node that the edge is going to.

Trait Implementations

impl Clone for DynamicEdge

fn clone(&self) -> DynamicEdge

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DynamicEdge

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

Formats the value using the given formatter.

impl Display for DynamicEdge

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

Formats the value using the given formatter.

impl Edge for DynamicEdge

fn direction(&self) -> EdgeDirection

Whether the edge is bidirectional

fn lhs(&self) -> usize

The left side node id of the edge

fn rhs(&self) -> usize

The right side node id of the edge

fn max_index(&self) -> usize

The smaller of the two indices.

fn min_index(&self) -> usize

The smaller of the two indices.

fn delta_index(&self) -> usize

The smaller of the two indices.

fn as_dynamic(&self) -> DynamicEdge

Creates a new edge with the indices swapped.

impl PartialEq<DynamicEdge> for DynamicEdge

fn eq(&self, other: &DynamicEdge) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for DynamicEdge

impl Eq for DynamicEdge

impl StructuralEq for DynamicEdge

impl StructuralPartialEq for DynamicEdge