Struct Node 

pub struct Node {
    pub id: NodeId,
    pub labels: Vec<String>,
    pub properties: BTreeMap<String, PropertyValue>,
    pub first_outgoing_edge_id: EdgeId,
    pub first_incoming_edge_id: EdgeId,
}

Represents a node in the graph.

Nodes are the primary entities in a graph database and can have multiple labels and properties. Nodes are connected by edges.

Fields

• id - Unique identifier for the node
• labels - List of labels categorizing the node
• properties - Key-value pairs storing node attributes
• first_outgoing_edge_id - Head of the outgoing edge linked list
• first_incoming_edge_id - Head of the incoming edge linked list

Examples

use sombra::model::{Node, PropertyValue};
use std::collections::BTreeMap;

let mut properties = BTreeMap::new();
properties.insert("name".to_string(), PropertyValue::String("Alice".to_string()));
properties.insert("age".to_string(), PropertyValue::Int(30));

let mut node = Node::new(1);
node.labels.push("Person".to_string());
node.properties = properties;

Fields

id: NodeId

Unique identifier for this node

labels: Vec<String>

Labels that categorize this node

properties: BTreeMap<String, PropertyValue>

Properties as key-value pairs

first_outgoing_edge_id: EdgeId

First edge in the outgoing edge list

first_incoming_edge_id: EdgeId

First edge in the incoming edge list

Implementations

impl Node

pub fn new(id: NodeId) -> Self

Creates a new node with the given ID.

The node starts with no labels, no properties, and no edges.

Arguments

• id - Unique identifier for the node

Returns

A new Node instance.

Example

use sombra::model::Node;

let node = Node::new(1);
assert_eq!(node.id, 1);
assert!(node.labels.is_empty());
assert!(node.properties.is_empty());

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl PartialEq for Node

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