Struct TraversalOptions 

pub struct TraversalOptions {
    pub algorithm: TraversalAlgorithm,
    pub direction: TraversalDirection,
    pub max_depth: usize,
    pub max_cross_repo_hops: usize,
    pub node_limit: usize,
    pub edge_limit: usize,
    pub timeout_ms: u64,
    pub k: usize,
    pub edge_kind_costs: Vec<EdgeKindCost>,
}

Bounds and costs controlling one graph traversal.

Fields

algorithm: TraversalAlgorithm

Traversal strategy.

direction: TraversalDirection

Relationship direction.

max_depth: usize

Maximum number of segments in a path.

max_cross_repo_hops: usize

Maximum number of cross-repository segments in a path.

node_limit: usize

Maximum number of distinct nodes observed.

edge_limit: usize

Maximum number of relationship examinations.

timeout_ms: u64

Wall-clock budget in milliseconds.

k: usize

Number of paths requested for k_shortest; inclusively bounded by 16.

edge_kind_costs: Vec<EdgeKindCost>

Optional positive base costs keyed by relationship kind.

Trait Implementations

impl Clone for TraversalOptions

fn clone(&self) -> TraversalOptions

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TraversalOptions

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

Formats the value using the given formatter.

impl Default for TraversalOptions

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TraversalOptions

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl JsonSchema for TraversalOptions

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl PartialEq for TraversalOptions

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for TraversalOptions

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TraversalOptions