Enum EmptyGraphEdgeInputAction 

pub enum EmptyGraphEdgeInputAction {
    ReturnEmpty,
    ValidateSelectorsThenReturnEmpty,
    Reject,
    BfsEndpointPolicy,
    SimilarityVertexPairs,
}

Action for a sanitized empty graph edge list.

Variants

ReturnEmpty

The operation has a schema-correct zero-row result.

ValidateSelectorsThenReturnEmpty

Validate explicit vertex selectors first, then return the zero-row result only when no selector requires a vertex.

Reject

The operation cannot run without at least one graph edge/vertex.

BfsEndpointPolicy

BFS delegates empty-edge behavior to its explicit endpoint policy.

SimilarityVertexPairs

Explicit-pair similarity returns a stable empty result for an empty pair relation and rejects non-empty pairs against an empty graph.

Implementations

impl EmptyGraphEdgeInputAction

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

Stable policy label for diagnostics and contract tests.

Trait Implementations

impl Clone for EmptyGraphEdgeInputAction

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for EmptyGraphEdgeInputAction

impl Debug for EmptyGraphEdgeInputAction

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

Formats the value using the given formatter.

impl Eq for EmptyGraphEdgeInputAction

impl Hash for EmptyGraphEdgeInputAction

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 EmptyGraphEdgeInputAction

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for EmptyGraphEdgeInputAction