Enum GraphMutationKind 

#[repr(u8)]
pub enum GraphMutationKind {
    AddNode = 0,
    RemoveNode = 1,
    AddEdge = 2,
    RemoveEdge = 3,
    UpdateEdgeWeight = 4,
    UpdateNodeMeta = 5,
}

Kind of graph mutation operation.

Variants

AddNode = 0

Add a new node to the graph.

RemoveNode = 1

Remove a node and all its edges.

AddEdge = 2

Add a new edge between two nodes.

RemoveEdge = 3

Remove an edge between two nodes.

UpdateEdgeWeight = 4

Update the weight of an existing edge.

UpdateNodeMeta = 5

Update node metadata.

Implementations

impl GraphMutationKind

pub const fn as_str(&self) -> &'static str

Returns the mutation kind as a string.

pub const fn from_u8(value: u8) -> Option<Self>

Converts from a raw u8 value.

Trait Implementations

impl Clone for GraphMutationKind

fn clone(&self) -> GraphMutationKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphMutationKind

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

Formats the value using the given formatter.

impl Hash for GraphMutationKind

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GraphMutationKind

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

impl Eq for GraphMutationKind

impl StructuralPartialEq for GraphMutationKind