Struct GraphEdgeDto 

pub struct GraphEdgeDto {
    pub from_id: String,
    pub to_id: String,
    pub kind: &'static str,
    pub label: String,
}

One graph edge. kind is relation | fact | has_statement | mentions for the typed-graph projections, or one of the eight memory↔memory link names (caused | followed_by | derived_from | similar_to | contradicts | supports | references | part_of).

Fields

from_id: String

to_id: String

kind: &'static str

label: String

Predicate / relation-type label; empty for mentions. For a memory↔memory edge it repeats the kind name, so a renderer can label every edge uniformly off label.

Trait Implementations

impl Debug for GraphEdgeDto

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

Formats the value using the given formatter.

impl From<GraphEdge> for GraphEdgeDto

fn from(e: GraphEdge) -> Self

Converts to this type from the input type.

impl Serialize for GraphEdgeDto

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

where __S: Serializer,

Serialize this value into the given Serde serializer.