Struct GraphHopEdge 

pub struct GraphHopEdge {
    pub hop: usize,
    pub direction: String,
    pub relation_type: String,
    pub weight: f32,
    pub from_id: String,
    pub to: GraphNodeRef,
}

One edge in the neighborhood expansion (BFS order).

Fields

hop: usize

Hop distance from the root (1 = direct neighbor).

direction: String

out if root-side was source; in if root-side was target.

relation_type: String

Relation label (relates_to, anchors, doc_links, auto_*, …).

weight: f32

Edge weight.

from_id: String

Node id on the parent side of this hop (closer to root).

to: GraphNodeRef

Neighbor node reached by this hop.

Trait Implementations

impl Clone for GraphHopEdge

fn clone(&self) -> GraphHopEdge

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphHopEdge

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphHopEdge

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for GraphHopEdge

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

where __S: Serializer,

Serialize this value into the given Serde serializer.