Enum SearchQueryAlgorithm 

pub enum SearchQueryAlgorithm {
    BreadthFirst,
    DepthFirst,
    Index,
    Elements,
}

Search algorithm to be used

Variants

BreadthFirst

Examines each distance level from the search origin in full before continuing with the next level. E.g. when starting at a node it first examines all the edges and then nodes they lead to.

DepthFirst

Examines maximum distance it can reach following every element. E.g. when starting at anode it will go edge -> node -> edge -> node until it reaches dead end or encounters already visited element.

Index

Bypasses the graph traversal and inspects only the index specified as the first condition (key).

Elements

Examines all elements in the database disregarding the graph structure or any relationship between the elements.

Trait Implementations

impl Clone for SearchQueryAlgorithm

fn clone(&self) -> SearchQueryAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SearchQueryAlgorithm

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

Formats the value using the given formatter.

impl PartialEq for SearchQueryAlgorithm

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

fn serialized_size(&self) -> u64

fn serialize(&self) -> Vec<u8>

fn deserialize(buffer: &[u8]) -> Result<Self, DbError>

impl Copy for SearchQueryAlgorithm

impl StructuralPartialEq for SearchQueryAlgorithm