Struct GraphNode 

pub struct GraphNode { /* private fields */ }

A node in the knowledge graph.

Represents a typed entity with properties and an optional vector embedding. Nodes are distinct from Points in that they have a label (type) and structured properties, while Points are primarily vector data with metadata.

Example

use velesdb_core::collection::graph::GraphNode;
use serde_json::json;
use std::collections::HashMap;

let mut props = HashMap::new();
props.insert("name".to_string(), json!("Alice"));
props.insert("age".to_string(), json!(30));

let node = GraphNode::new(1, "Person")
    .with_properties(props)
    .with_vector(vec![0.1, 0.2, 0.3]);

Implementations

impl GraphNode

pub fn new(id: u64, label: &str) -> Self

Creates a new graph node with the given ID and label.

pub fn with_properties(self, properties: HashMap<String, Value>) -> Self

Adds properties to this node (builder pattern).

pub fn with_vector(self, vector: Vec<f32>) -> Self

Adds a vector embedding to this node (builder pattern).

pub fn id(&self) -> u64

Returns the node ID.

pub fn label(&self) -> &str

Returns the node label (type).

pub fn properties(&self) -> &HashMap<String, Value>

Returns all properties of this node.

pub fn property(&self, name: &str) -> Option<&Value>

Returns a specific property value, if it exists.

pub fn vector(&self) -> Option<&Vec<f32>>

Returns the optional vector embedding.

pub fn set_property(&mut self, name: &str, value: Value)

Sets a property value.

Trait Implementations

impl Clone for GraphNode

fn clone(&self) -> GraphNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphNode

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphNode

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphNode

fn eq(&self, other: &GraphNode) -> 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 GraphNode

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GraphNode