Expand description
The minimalist in-memory property graph — Rust port of
org.platformlambda.core.graph.MiniGraph (+ SimpleNode,
SimpleConnection, SimpleRelationship): nodes with types and untyped
properties, unidirectional connections carrying optional typed relations,
alias/id/type/property lookups, neighbor traversal and BFS path
discovery. Designed for a few hundred nodes held entirely in memory —
deliberately never a database (the repo vision’s non-goal); the Active
Knowledge Graph layer (layer 3) builds on it.
Ownership model (the one Rust translation): Java hands out shared mutable
SimpleNode objects; here nodes, connections and relations are
Arc-shared with interior mutability, so engine code can hold node
handles and mutate properties exactly like the Java callers do. Property
values are rmpv::Value — the same currency as envelope bodies and the
layer-2 state machine.
Structs§
- Graph
Properties - Shared property-bag behavior (Java
GraphProperties). - Mini
Graph - The mini-graph (Java
MiniGraph): an in-memory property graph designed to handle a small number of nodes very efficiently (default cap 750). - Simple
Connection - A unidirectional connection between two nodes, optionally carrying typed
relations (Java
SimpleConnection). Equality is by connection id. - Simple
Node - A graph node (Java
SimpleNode): unique alias, one or more types, and a property bag. Shared byArc; equality is by node id. - Simple
Relationship - A typed relation on a connection (Java
SimpleRelationship).