Struct graph_theory::UndirectedEdge

pub struct UndirectedEdge {
    pub from: usize,
    pub goto: usize,
}

UndirectedEdge

Fields

from: usize

goto: usize

Implementations

impl UndirectedEdge

pub fn max_index(&self) -> usize

pub fn min_index(&self) -> usize

pub fn as_range(&self) -> Range<usize>

Trait Implementations

impl Clone for UndirectedEdge

fn clone(&self) -> UndirectedEdge

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for UndirectedEdge

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

Formats the value using the given formatter.

impl Display for UndirectedEdge

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

Formats the value using the given formatter.

impl Edge for UndirectedEdge

fn from(&self) -> usize

fn goto(&self) -> usize

fn bidirectional(&self) -> bool

impl From<(usize, usize)> for UndirectedEdge

fn from(ordinal: (usize, usize)) -> UndirectedEdge

Converts to this type from the input type.

impl PartialEq<UndirectedEdge> for UndirectedEdge

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

impl Eq for UndirectedEdge

impl StructuralEq for UndirectedEdge

impl StructuralPartialEq for UndirectedEdge