Struct AnchorGraph 

pub struct AnchorGraph {
    pub nodes: Vec<AnchorRef>,
    pub edges: Vec<(Uuid, Uuid, String)>,
}

A graph of anchors, forming a causal chain.

Callers persist this across sessions. Brain navigates but doesn’t own.

Fields

nodes: Vec<AnchorRef>

All anchor nodes in this graph.

edges: Vec<(Uuid, Uuid, String)>

Edges: (from_id, to_id, relation) where relation is e.g. “derives_from”, “uses”, “contradicts”.

Implementations

impl AnchorGraph

pub fn new() -> Self

Create an empty anchor graph.

pub fn add_node(&mut self, anchor: AnchorRef)

Add a node to the graph.

pub fn add_edge(&mut self, from: Uuid, to: Uuid, relation: impl Into<String>)

Add an edge to the graph.

pub fn find_node(&self, id: Uuid) -> Option<&AnchorRef>

Find a node by its ID.

pub fn outgoing(&self, from: Uuid) -> impl Iterator<Item = (Uuid, &str)>

Get outgoing edges from a node.

pub fn incoming(&self, to: Uuid) -> impl Iterator<Item = (Uuid, &str)>

Get incoming edges to a node.

Trait Implementations

impl Clone for AnchorGraph

fn clone(&self) -> AnchorGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AnchorGraph

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

Formats the value using the given formatter.

impl Default for AnchorGraph

fn default() -> AnchorGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for AnchorGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for AnchorGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.