Struct IndeterminateEdge

pub struct IndeterminateEdge {
    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

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.

Implementations

impl IndeterminateEdge

pub const fn new(from: usize, goto: usize) -> IndeterminateEdge

Trait Implementations

impl Clone for IndeterminateEdge

fn clone(&self) -> IndeterminateEdge

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for IndeterminateEdge

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

Formats the value using the given formatter.

impl Display for IndeterminateEdge

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

Formats the value using the given formatter.

impl Edge for IndeterminateEdge

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.

impl PartialEq for IndeterminateEdge

fn eq(&self, other: &IndeterminateEdge) -> 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 Copy for IndeterminateEdge

impl Eq for IndeterminateEdge

impl StructuralPartialEq for IndeterminateEdge