Struct SemanticSimilarityGraph 

pub struct SemanticSimilarityGraph {
    pub config: GraphConfig,
    pub nodes: HashMap<String, SgNode>,
    pub edges: HashMap<String, SgEdge>,
    pub adjacency: HashMap<String, Vec<String>>,
}

A graph of semantic embeddings connected by cosine similarity.

Fields

config: GraphConfig

Graph configuration.

nodes: HashMap<String, SgNode>

All nodes, keyed by node ID.

edges: HashMap<String, SgEdge>

All edges, keyed by min_id:max_id.

adjacency: HashMap<String, Vec<String>>

Adjacency list: node ID → list of neighbour IDs.

Implementations

impl SemanticSimilarityGraph

pub fn new(config: GraphConfig) -> Self

Create an empty graph with the given configuration.

pub fn with_defaults() -> Self

Create a graph with default configuration.

pub fn similarity(a: &[f64], b: &[f64]) -> f64

Compute cosine similarity between two embedding vectors.

Returns 0.0 if either vector is all-zero, empty, or dimensions differ.

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

Add a node to the graph.

Computes similarity with every existing node and adds edges where the similarity is ≥ config.similarity_threshold. When auto_prune is enabled the lowest-similarity edge of each over-full neighbour list is dropped.

pub fn remove_node(&mut self, node_id: &str) -> bool

Remove a node and all edges connected to it.

Returns true if the node existed.

pub fn get_node(&self, node_id: &str) -> Option<&SgNode>

Look up a node by ID.

pub fn neighbors(&self, node_id: &str) -> Vec<(&SgNode, f64)>

Return all neighbours of node_id, sorted by similarity descending.

pub fn most_similar(&self, node_id: &str, n: usize) -> Vec<(&SgNode, f64)>

Return the top-n most similar neighbours of node_id.

pub fn find_communities(&self, min_community_size: usize) -> Vec<SgCommunity>

Detect communities using BFS connected components, filtered by min_community_size. Centroid and cohesion are computed for each returned community.

pub fn community_of(node_id: &str, communities: &[SgCommunity]) -> Option<usize>

Return the community ID that contains node_id, if any.

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

BFS shortest path from from to to.

Returns None if either node does not exist or no path exists.

pub fn subgraph(&self, node_ids: &[&str]) -> SemanticSimilarityGraph

Induce a subgraph from the given node IDs, including only edges whose both endpoints are in the set.

pub fn density(&self) -> f64

Graph density: |E| / (n*(n-1)/2). Returns 0.0 for fewer than 2 nodes.

pub fn avg_degree(&self) -> f64

Mean number of neighbours per node. Returns 0.0 if empty.

pub fn node_count(&self) -> usize

Number of nodes.

pub fn edge_count(&self) -> usize

Number of edges.

pub fn stats(&self) -> SgStats

Compute aggregate graph statistics.

Trait Implementations

impl Clone for SemanticSimilarityGraph

fn clone(&self) -> SemanticSimilarityGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SemanticSimilarityGraph

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

Formats the value using the given formatter.