Enum EmptyGraphSideInputPolicy 

pub enum EmptyGraphSideInputPolicy {
    None,
    RequirePersonalization,
    BfsPredicates,
    RequireVertexPairs,
}

Relation-backed input contract for an empty graph operation.

Variants

None

The operation accepts no relation-backed side input.

RequirePersonalization

Personalized PageRank requires a non-empty personalization relation.

BfsPredicates

BFS has role-specific source and predicate semantics owned by its traversal executor.

RequireVertexPairs

Explicit-pair similarity owns pair-cardinality and endpoint behavior.

Implementations

impl EmptyGraphSideInputPolicy

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

Stable policy label for diagnostics and contract tests.

Trait Implementations

impl Clone for EmptyGraphSideInputPolicy

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 EmptyGraphSideInputPolicy

impl Debug for EmptyGraphSideInputPolicy

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

Formats the value using the given formatter.

impl Eq for EmptyGraphSideInputPolicy

impl Hash for EmptyGraphSideInputPolicy

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 EmptyGraphSideInputPolicy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for EmptyGraphSideInputPolicy