Struct EmptyGraphInputPolicy 

pub struct EmptyGraphInputPolicy {
    pub edge_input: EmptyGraphEdgeInputAction,
    pub side_inputs: EmptyGraphSideInputPolicy,
}

Engine-owned behavior when a graph operation receives no usable edges.

The executor applies this after null edge rows have been removed and before graph admission or cuGraph construction. This keeps empty-input semantics independent of libcugraph’s incidental behavior and distinguishes a valid empty result from an operation that requires an actual graph or side input.

Fields

edge_input: EmptyGraphEdgeInputAction

Action for an empty edge list after input sanitization.

side_inputs: EmptyGraphSideInputPolicy

Contract for any relation-backed algorithm inputs.

Trait Implementations

impl Clone for EmptyGraphInputPolicy

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 EmptyGraphInputPolicy

impl Debug for EmptyGraphInputPolicy

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

Formats the value using the given formatter.

impl Eq for EmptyGraphInputPolicy

impl Hash for EmptyGraphInputPolicy

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 EmptyGraphInputPolicy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for EmptyGraphInputPolicy