Struct GraphTree 

pub struct GraphTree { /* private fields */ }

Graph tree structure for hierarchical memory organization

Implementations

impl GraphTree

pub fn new() -> Self

Create a new empty graph tree

pub fn add_memory( &mut self, memory_id: NodeId, category: &str, memory_lane_type: Option<&str>, priority: Option<u8>, )

Add a memory node to the tree

pub fn remove_memory(&mut self, memory_id: NodeId) -> bool

Remove a memory node from the tree

pub fn get(&self, id: NodeId) -> Option<&GraphNode>

Get a node by ID

pub fn get_memories_by_category(&self, category: &str) -> Vec<NodeId>

Get all memory IDs in a category

pub fn get_memories_by_lane_type(&self, lane_type: &str) -> Vec<NodeId>

Get all memory IDs with a specific lane type

pub fn get_ancestors(&self, node_id: NodeId) -> Vec<NodeId>

Get ancestors of a node (path to root)

pub fn get_descendants(&self, node_id: NodeId) -> Vec<NodeId>

Get descendants of a node (BFS)

pub fn calculate_boosted_score( &self, memory_id: NodeId, base_similarity: f32, ) -> f32

Calculate boosted relevance score based on tree structure

pub fn stats(&self) -> TreeStats

Get tree statistics

pub fn traverse_bfs(&self, start_id: NodeId) -> Vec<NodeId>

Breadth-first traversal from a starting node

pub fn traverse_dfs_preorder(&self, start_id: NodeId) -> Vec<NodeId>

Depth-first traversal (pre-order) from a starting node

pub fn traverse_dfs_postorder(&self, start_id: NodeId) -> Vec<NodeId>

Depth-first traversal (post-order) from a starting node

pub fn get_nodes_at_depth(&self, depth: u32) -> Vec<NodeId>

Get nodes at a specific depth level

pub fn get_all_leaves(&self) -> Vec<NodeId>

Get all leaf nodes (memory entries)

pub fn get_path(&self, node_id: NodeId) -> Vec<NodeId>

Get path from root to a specific node

pub fn find_lca(&self, node_a: NodeId, node_b: NodeId) -> Option<NodeId>

Find lowest common ancestor of two nodes

pub fn distance(&self, node_a: NodeId, node_b: NodeId) -> Option<u32>

Calculate the distance between two nodes

pub fn subtree_size(&self, node_id: NodeId) -> usize

Get subtree size for a node (including itself)

pub fn prune_below_depth(&mut self, max_depth: u32) -> Vec<NodeId>

Prune nodes below a certain depth

pub fn find_matching<F>(&self, predicate: F) -> Vec<NodeId>

where F: Fn(&GraphNode) -> bool,

Find all nodes matching a predicate

pub fn get_siblings(&self, node_id: NodeId) -> Vec<NodeId>

Get siblings of a node

pub fn rebalance_weights(&mut self)

Rebalance weights in the tree

Trait Implementations

impl Clone for GraphTree

fn clone(&self) -> GraphTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphTree

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

Formats the value using the given formatter.

impl Default for GraphTree

fn default() -> GraphTree

Returns the “default value” for a type.