Struct RelationshipGraph 

pub struct RelationshipGraph { /* private fields */ }

Relationship graph for entity context

Implementations

impl RelationshipGraph

pub fn new() -> Self

Create a new empty relationship graph.

pub fn from_entity_store(store: &EntityStore) -> Self

Build graph from entity store

pub fn calculate_importance(entity: &Entity) -> f32

Calculate importance score for an entity.

Combines log-scaled mention count, entity-type bonus, and message-spread proxy into a score in [0.0, 1.0].

Known limitation: ln(1) = 0, so the mention-count component contributes nothing for entities seen exactly once. The type bonus and message-spread proxy still apply, so the score is non-zero, but a single-mention entity is scored identically regardless of how many times it was seen (just once vs. genuinely once). Use ln(mention_count + 1) to remove this discontinuity if needed.

pub fn add_node(&mut self, node: GraphNode)

Add a node to the graph

pub fn add_edge(&mut self, edge: GraphEdge)

Add an edge to the graph

pub fn add_relationship(&mut self, rel: &Relationship)

Add relationship as edge

pub fn get_node(&self, name: &str) -> Option<&GraphNode>

Get node by name

pub fn get_neighbors(&self, name: &str) -> Vec<&GraphNode>

Get all neighbors of a node

pub fn get_edges(&self, name: &str) -> Vec<&GraphEdge>

Get edges for a node

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

Find shortest path between two entities using BFS

pub fn get_entity_context( &self, entity: &str, max_depth: usize, ) -> EntityContext

Get all context related to an entity (traverses graph)

pub fn search(&self, query: &str, limit: usize) -> Vec<&GraphNode>

Find entities most relevant to a query (by name matching)

pub fn stats(&self) -> GraphStats

Get graph statistics

pub fn get_impact_set(&self, entity: &str, depth: usize) -> Vec<ImpactedEntity>

Get entities that would be impacted by changes to a given entity. Traverses the graph to find dependent entities up to a specified depth.

pub fn find_clusters(&self) -> Vec<EntityCluster>

Find clusters of related entities using connected component analysis

pub fn suggest_related(&self, entities: &[&str]) -> Vec<SuggestedEntity>

Suggest related entities given a set of entities. Uses co-occurrence and relationship analysis.

pub fn get_central_nodes(&self, limit: usize) -> Vec<&GraphNode>

Get the most central nodes in the graph (by connectivity)

Trait Implementations

impl Debug for RelationshipGraph

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

Formats the value using the given formatter.

impl Default for RelationshipGraph

fn default() -> RelationshipGraph

Returns the “default value” for a type.

impl RelationshipGraphT for RelationshipGraph

fn get_node(&self, name: &str) -> Option<&GraphNode>

Get a node by name.

fn get_neighbors(&self, name: &str) -> Vec<&GraphNode>

Get all neighbor nodes.

fn get_edges(&self, name: &str) -> Vec<&GraphEdge>

Get all edges for a node.

fn search(&self, query: &str, limit: usize) -> Vec<&GraphNode>

Search for nodes matching a query string.

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

Find the shortest path between two nodes.