Struct GraphTuning 

pub struct GraphTuning {
    pub max_visited: usize,
    pub max_depth: usize,
    pub lcc_high_degree_threshold: usize,
    pub lcc_sample_pairs: usize,
    pub varlen_max_results: usize,
    pub varlen_max_frontier: usize,
}

Graph engine tuning (traversal limits, LCC algorithm).

Fields

max_visited: usize

max_depth: usize

lcc_high_degree_threshold: usize

lcc_sample_pairs: usize

varlen_max_results: usize

Hard cap on results emitted from a single variable-length MATCH ([*min..max]) expansion. When an expansion would exceed this it truncates at the current hop boundary and surfaces a resume cursor so the remainder is paged across follow-up rounds (cross-shard or local) — no row is silently dropped. Bounds peak per-expansion result allocation.

varlen_max_frontier: usize

Hard cap on the live (per-hop) frontier of a single variable-length MATCH expansion. When a single hop would grow the frontier past this it truncates and pages via resume, bounding peak intermediate allocation on dense / bidirectional traversals.

Trait Implementations

impl Clone for GraphTuning

fn clone(&self) -> GraphTuning

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphTuning

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

Formats the value using the given formatter.

impl Default for GraphTuning

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GraphTuning

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for GraphTuning

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.