minigdb 0.1.0

An embedded property-graph database in Rust with a GQL query language, RocksDB-backed ACID storage, graph algorithms, and Python bindings
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

//! [`Node`] — a graph vertex with a stable ULID identity, labels, and properties.

use serde::{Deserialize, Serialize};

use super::{NodeId, Properties};

/// A node (vertex) in the property graph.
///
/// Nodes are identified by a [`NodeId`] (ULID), may carry one or more string
/// labels (e.g. `"Person"`, `"Company"`), and hold an arbitrary key-value
/// [`Properties`] map.
///
/// `PartialEq` is derived for testing; production code should compare by `id`.
#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub struct Node {
    /// Globally unique, immutable identifier (ULID as `u128`).
    pub id: NodeId,
    /// Type labels — all must be present for label-constraint filters to match.
    pub labels: Vec<String>,
    /// Arbitrary key-value property bag.
    pub properties: Properties,
}

impl Node {
    /// Construct a `Node` from its constituent parts.
    pub fn new(id: NodeId, labels: Vec<String>, properties: Properties) -> Self {
        Self { id, labels, properties }
    }
}