Enum GraphKind

#[repr(u8)]
pub enum GraphKind {
    Directed = 0,
    Undirected = 1,
}

Mark the graph as directed or undirected.

Generally speaking, a directed graph engine can insert undirected edges, but a undirected graph engine cannot insert directed edges.

Examples

use graph_theory::{graph_engines::CycleGraph, GraphEngine, GraphKind};
assert_eq!(CycleGraph::one_way(5).graph_kind(), GraphKind::Directed);
assert_eq!(CycleGraph::two_way(5).graph_kind(), GraphKind::Undirected);

Variants

Directed = 0

Arguments

• index:

returns: Option<CowSelf::Node>

Examples

use graph_theory::GraphEngine;

Undirected = 1

Arguments

• index:

returns: Option<CowSelf::Node>

Examples

use graph_theory::GraphEngine;

Implementations

impl GraphKind

pub const fn is_one_way(&self) -> bool

pub const fn is_two_way(&self) -> bool

Trait Implementations

impl Clone for GraphKind

fn clone(&self) -> GraphKind

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GraphKind

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

Formats the value using the given formatter.

impl PartialEq for GraphKind

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

impl Eq for GraphKind

impl StructuralPartialEq for GraphKind