Struct Graph 

pub struct Graph {
    pub nodes: Vec<Node>,
    pub rels: Vec<Relationship>,
}

Simple in-memory graph representation for the reference engine.

Not representative of production performance. All lookups are O(n) linear scans over Vec. Production engines should use indexed storage (e.g., HashMap<u64, Node>) or implement StorageAdapter to map Plexus ops onto their native storage layer. See docs/storage-engine-mapping.md.

Fields

nodes: Vec<Node>

rels: Vec<Relationship>

Implementations

impl Graph

pub fn node_by_id(&self, id: u64) -> Option<&Node>

O(n) linear scan — production engines should use indexed lookups.

pub fn node_by_id_mut(&mut self, id: u64) -> Option<&mut Node>

O(n) linear scan — production engines should use indexed lookups.

pub fn rel_by_id(&self, id: u64) -> Option<&Relationship>

O(n) linear scan — production engines should use indexed lookups.

pub fn rel_by_id_mut(&mut self, id: u64) -> Option<&mut Relationship>

O(n) linear scan — production engines should use indexed lookups.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl PartialEq for Graph

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