Struct GraphSearchExpandRequest 

pub struct GraphSearchExpandRequest {
    pub graph_name: String,
    pub query: Vec<f32>,
    pub k: u32,
    pub ef: u32,
    pub depth: u32,
    pub edge_type: String,
    pub as_of: u64,
    pub reverse: bool,
    pub max_nodes: u32,
    pub max_degree: u32,
    pub tx_as_of: u64,
}

Fields

graph_name: String

query: Vec<f32>

query embedding for anchor selection

k: u32

number of vector anchors (top-k)

ef: u32

0 = use default ef_search

depth: u32

BFS hop count from each anchor (0 = anchors only)

edge_type: String

empty = all edge types

as_of: u64

0 = no time bound; only edges with valid_from <= as_of

reverse: bool

true = expand along incoming edges

max_nodes: u32

Upper bound on total nodes returned (anchors + expanded). 0 = engine default (DEFAULT_MAX_EXPAND_NODES = 10000, never unbounded); pass an explicit large value (e.g. u32 max) to raise the cap.

max_degree: u32

Per-node edge fanout cap: when expanding a single frontier node, scan at most this many of its edges, so a high-degree supernode cannot be materialized in full (OOM / latency). 0 = engine default.

tx_as_of: u64

Transaction-time (as-of-then belief) point, ms. 0 = current belief (no bound). When set, only edges believed at tx_as_of are traversed/returned (tx_from <= tx_as_of && (tx_to == 0 || tx_to > tx_as_of)); legacy edges with tx_from == 0 are treated as always known. This excludes edges that were transactionally corrected/retracted after tx_as_of, matching the bitemporal predicate the adjacent traversal path already enforces.

Trait Implementations

impl Clone for GraphSearchExpandRequest

fn clone(&self) -> GraphSearchExpandRequest

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphSearchExpandRequest

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

Formats the value using the given formatter.

impl Default for GraphSearchExpandRequest

fn default() -> Self

Returns the “default value” for a type.

impl Message for GraphSearchExpandRequest

fn encoded_len(&self) -> usize

Returns the encoded length of the message without a length delimiter.

fn clear(&mut self)

Clears the message, resetting all fields to their default.

fn encode(&self, buf: &mut impl BufMut) -> Result<(), EncodeError>

where Self: Sized,

Encodes the message to a buffer.

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

where Self: Sized,

Encodes the message to a newly allocated buffer.

fn encode_length_delimited( &self, buf: &mut impl BufMut, ) -> Result<(), EncodeError>

where Self: Sized,

Encodes the message with a length-delimiter to a buffer.

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

where Self: Sized,

Encodes the message with a length-delimiter to a newly allocated buffer.

fn decode(buf: impl Buf) -> Result<Self, DecodeError>

where Self: Default,

Decodes an instance of the message from a buffer.

fn decode_length_delimited(buf: impl Buf) -> Result<Self, DecodeError>

where Self: Default,

Decodes a length-delimited instance of the message from the buffer.

fn merge(&mut self, buf: impl Buf) -> Result<(), DecodeError>

where Self: Sized,

Decodes an instance of the message from a buffer, and merges it into self.

fn merge_length_delimited(&mut self, buf: impl Buf) -> Result<(), DecodeError>

where Self: Sized,

Decodes a length-delimited instance of the message from buffer, and merges it into self.

impl PartialEq for GraphSearchExpandRequest

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphSearchExpandRequest