Struct HnswGraph 

pub struct HnswGraph {
    pub nodes: HashMap<EntityId, HnswNode>,
    pub entry_point: Option<EntityId>,
    pub max_layer: usize,
    pub distance_metric: DistanceMetric,
    pub dimension: usize,
}

The HNSW graph structure.

Fields

nodes: HashMap<EntityId, HnswNode>

All nodes in the graph, keyed by entity ID.

entry_point: Option<EntityId>

The entry point node (highest level node).

max_layer: usize

The current maximum layer in the graph.

distance_metric: DistanceMetric

The distance metric used for similarity.

dimension: usize

The dimension of embeddings in this graph.

Implementations

impl HnswGraph

pub fn new(dimension: usize, distance_metric: DistanceMetric) -> Self

Create a new empty HNSW graph.

pub fn get_node(&self, entity_id: EntityId) -> Option<&HnswNode>

Get a node by entity ID.

pub fn get_node_mut(&mut self, entity_id: EntityId) -> Option<&mut HnswNode>

Get a mutable node by entity ID.

pub fn contains(&self, entity_id: EntityId) -> bool

Check if a node exists in the graph.

pub fn len(&self) -> usize

Get the number of nodes in the graph.

pub fn is_empty(&self) -> bool

Check if the graph is empty.

pub fn distance(&self, a: &Embedding, b: &Embedding) -> f32

Calculate the distance between two embeddings.

pub fn distance_to_node( &self, query: &Embedding, entity_id: EntityId, ) -> Option<f32>

Calculate the distance from a query to a node.

pub fn insert_node(&mut self, node: HnswNode)

Insert a node into the graph.

pub fn remove_node(&mut self, entity_id: EntityId) -> Option<HnswNode>

Remove a node from the graph.

Trait Implementations

impl Debug for HnswGraph

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

Formats the value using the given formatter.