Struct GraphEdgePair 

pub struct GraphEdgePair {
    pub source_entity_id: Uuid,
    pub target_entity_id: Uuid,
    pub relationship_name: String,
    pub properties: HashMap<String, String>,
}

An edge in the storage layer with source/target entities.

Represents a relationship between two entities. Unlike the LLM-layer Edge which uses node IDs, this uses entity UUIDs for database storage.

Fields

source_entity_id: Uuid

Source entity UUID

target_entity_id: Uuid

Target entity UUID

relationship_name: String

Relationship name (e.g., “works_at”, “located_in”)

properties: HashMap<String, String>

Additional edge properties (flexible key-value storage)

Implementations

impl GraphEdgePair

pub fn new( source_entity_id: Uuid, target_entity_id: Uuid, relationship_name: impl Into<String>, ) -> GraphEdgePair

Create a new GraphEdgePair.

pub fn with_properties( source_entity_id: Uuid, target_entity_id: Uuid, relationship_name: impl Into<String>, properties: HashMap<String, String>, ) -> GraphEdgePair

Create an edge with properties.

pub fn dedup_key(&self) -> (Uuid, Uuid, String)

Get the deduplication key for this edge.

Format: “{source_id}{target_id}{relationship_name}” This matches the Python implementation.

pub fn add_property(&mut self, key: impl Into<String>, value: impl Into<String>)

Add a property to the edge.

Trait Implementations

impl Clone for GraphEdgePair

fn clone(&self) -> GraphEdgePair

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphEdgePair

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphEdgePair

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphEdgePair

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphEdgePair

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.

impl StructuralPartialEq for GraphEdgePair