Struct GraphTraversalConfig 

pub struct GraphTraversalConfig {
    pub enabled: bool,
    pub algorithm: String,
    pub damping_factor: f32,
    pub max_iterations: usize,
    pub personalized: bool,
}

Configuration for graph-based traversal and ranking algorithms.

Enables graph algorithms like PageRank and personalized search for navigating and ranking content in the knowledge graph.

Fields

enabled: bool

Whether graph traversal algorithms are enabled

algorithm: String

Algorithm to use for graph traversal (e.g., “pagerank”, “hits”, “random_walk”)

damping_factor: f32

Damping factor for PageRank algorithm (typically 0.85)

max_iterations: usize

Maximum iterations for graph algorithms

personalized: bool

Whether to use personalized graph traversal

Trait Implementations

impl Clone for GraphTraversalConfig

fn clone(&self) -> GraphTraversalConfig

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphTraversalConfig

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

Formats the value using the given formatter.

impl Default for GraphTraversalConfig

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for GraphTraversalConfig

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for GraphTraversalConfig

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

where __S: Serializer,

Serialize this value into the given Serde serializer.