Struct GraphEdge 

pub struct GraphEdge {

    pub id: MemoryId,
    pub source: MemoryId,
    pub target: MemoryId,
    pub relation: EdgeRelation,
    pub weight: f32,
    pub co_retrieval_count: u64,
    pub created_at: Timestamp,
    pub updated_at: Timestamp,
    pub valid_from: Option<Timestamp>,
    pub valid_until: Option<Timestamp>,
    pub metadata: BTreeMap<String, MetadataValue>,
    pub resolved: bool,
    pub namespace: Namespace,
    pub causal: Option<Box<CausalEdgeData>>,
}

A typed, weighted edge in the property graph.

Fields

id: MemoryId

source: MemoryId

target: MemoryId

relation: EdgeRelation

weight: f32

co_retrieval_count: u64

created_at: Timestamp

updated_at: Timestamp

valid_from: Option<Timestamp>

valid_until: Option<Timestamp>

metadata: BTreeMap<String, MetadataValue>

resolved: bool

Whether this contradiction has been resolved by ABA reconsolidation.

namespace: Namespace

Namespace of the source node (inherited at edge creation).

causal: Option<Box<CausalEdgeData>>

Causal-specific metadata. None for non-causal edges, keeping the struct small (16 bytes vs ~128 bytes with 7 inlined optionals).

Implementations

impl GraphEdge

pub fn strength(&self) -> Option<f32>

Causal strength, or None if this is not a causal edge.

pub fn confidence(&self) -> Option<f32>

Causal confidence, or None if this is not a causal edge.

pub fn evidence_count(&self) -> Option<u32>

Evidence count, or None if this is not a causal edge.

pub fn confounders(&self) -> Option<&[String]>

Confounders slice, or None if this is not a causal edge.

pub fn provenance(&self) -> Option<&str>

Provenance, or None if this is not a causal edge or provenance is unset.

pub fn mechanism(&self) -> Option<&str>

Mechanism, or None if this is not a causal edge or mechanism is unset.

pub fn direction(&self) -> Option<CausalDirection>

Causal direction, or None if this is not a causal edge or direction is unset.

pub fn relevance_score(&self) -> Option<f32>

Causal relevance score: strength × confidence × ln(1 + evidence_count).

Returns None if this edge has no causal metadata. A higher score indicates stronger, more certain causal evidence.

pub fn is_valid_at(&self, as_of: Timestamp) -> bool

Whether this edge is valid at the given point in time.

An edge is valid at as_of when:

• valid_from is None OR valid_from <= as_of, AND
• valid_until is None OR valid_until > as_of

pub fn is_currently_active(&self) -> bool

Whether this edge is currently active (not yet expired).

Equivalent to is_valid_at(Timestamp::now()).

Trait Implementations

impl Clone for GraphEdge

fn clone(&self) -> GraphEdge

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphEdge

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphEdge

fn deserialize<__D>( __deserializer: __D, ) -> Result<GraphEdge, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for GraphEdge

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

where __S: Serializer,

Serialize this value into the given Serde serializer.