Struct SimpleEntityGraph 

pub struct SimpleEntityGraph {
    pub entities: BTreeMap<String, EntityData>,
    pub entity_mentions: BTreeMap<String, Vec<Uuid>>,
    /* private fields */
}

Enhanced entity graph using petgraph for efficient relationship operations

Fields

entities: BTreeMap<String, EntityData>

Entity metadata storage - uses BTreeMap for deterministic JSON serialization

entity_mentions: BTreeMap<String, Vec<Uuid>>

Entity mentions tracking - uses BTreeMap for deterministic JSON serialization

Implementations

impl SimpleEntityGraph

pub fn new() -> SimpleEntityGraph

Creates a new empty entity graph

pub fn clear(&mut self)

Clear all entities, relationships, and graph data

pub fn remove_entity(&mut self, name: &str) -> bool

Remove a single entity and all its incident edges. Returns true if the entity existed and was removed.

DiGraph::remove_node moves the LAST node into the vacated slot, which invalidates the previous-last NodeIndex. We patch both index maps for the swapped node so subsequent lookups stay correct.

pub fn has_entity(&self, name: &str) -> bool

Check if entity exists in the graph

pub fn entity_count(&self) -> usize

Get the number of entities in the graph

pub fn update_entity_timestamp(&mut self, name: &str, timestamp: DateTime<Utc>)

Update entity timestamp without changing other properties

pub fn add_or_update_entity( &mut self, name: String, entity_type: EntityType, timestamp: DateTime<Utc>, description: &str, )

Add or update entity - maintains same API as original SimpleEntityGraph

pub fn mention_entity( &mut self, name: &str, update_id: Uuid, timestamp: DateTime<Utc>, )

Mention entity - updates importance and tracking

pub fn add_relationship(&mut self, relationship: EntityRelationship)

Add relationship - now uses petgraph for efficient storage

pub fn merge_from(&mut self, other: &SimpleEntityGraph)

Merge all entities and relationships from another graph into this one.

Entities are added with add_or_update_entity (so counts accumulate for entities that appear in multiple sessions). Edges are copied as-is.

pub fn find_related_entities(&self, entity_name: &str) -> Vec<String>

Find related entities - now O(degree) instead of O(n)! Uses BTreeSet for automatic sorting, avoiding explicit sort() call Supports case-insensitive lookup with fallback

pub fn find_related_entities_by_type( &self, entity_name: &str, relation_type: &RelationType, ) -> Vec<String>

Find related entities by specific relation type - also now O(degree) instead of O(n) Uses BTreeSet for automatic sorting, avoiding explicit sort() call Supports case-insensitive lookup with fallback

pub fn get_entities_by_type(&self, entity_type: &EntityType) -> Vec<&EntityData>

Get entities by type - unchanged from original

pub fn get_most_important_entities(&self, limit: usize) -> Vec<&EntityData>

Get most important entities - unchanged from original

pub fn get_recently_mentioned_entities(&self, limit: usize) -> Vec<&EntityData>

Get recently mentioned entities - unchanged from original

pub fn search_entities(&self, query: &str) -> Vec<&EntityData>

Search entities by name or description (case-insensitive)

pub fn get_entity_context(&self, entity_name: &str) -> Option<String>

Get entity context with improved relationship lookup

pub fn get_entity_relationships( &self, entity_name: &str, ) -> Vec<(String, RelationType, String)>

Get entity relationships - now uses efficient petgraph edge iteration Returns (entity_name, relation_type, context) tuples

pub fn trace_entity_relationships( &self, start_entity: &str, max_depth: usize, ) -> Vec<(String, String, String)>

Trace entity relationships using efficient BFS

pub fn get_entity_network( &self, center_entity: &str, max_depth: usize, ) -> EntityNetwork

Get entity network using efficient graph traversal

pub fn analyze_entity_importance(&self) -> Vec<EntityAnalysis>

Analyze entity importance with graph metrics

pub fn find_shortest_path(&self, from: &str, to: &str) -> Option<Vec<String>>

New petgraph-specific methods

Find shortest path between two entities using A* algorithm Returns the complete path including start and end nodes

pub fn get_graph_stats(&self) -> GraphStats

Get graph statistics

pub fn find_communities(&self) -> Vec<Vec<String>>

Find strongly connected components

pub fn get_all_relationships(&self) -> Vec<EntityRelationship>

Get all relationships in the graph as EntityRelationship structs Used for migration to SurrealDB native graph format

pub fn get_all_entities(&self) -> Vec<EntityData>

Get all entities as a vector (convenience method for migration)

Trait Implementations

impl Clone for SimpleEntityGraph

fn clone(&self) -> SimpleEntityGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SimpleEntityGraph

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

Formats the value using the given formatter.

impl Default for SimpleEntityGraph

fn default() -> SimpleEntityGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for SimpleEntityGraph

fn deserialize<D>( deserializer: D, ) -> Result<SimpleEntityGraph, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for SimpleEntityGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.