Struct GraphMerger 

pub struct GraphMerger { /* private fields */ }

HNSW Graph Merger using IGTM algorithm

Merges a small graph into a large graph using strategic vertex selection. Expected 1.3-1.7x speedup over naive insertion.

Implementations

impl GraphMerger

pub fn new() -> Self

Create a new graph merger with default configuration

pub fn with_config(config: MergeConfig) -> Self

Create a new graph merger with custom configuration

pub fn merge_graphs( &self, large: &mut HNSWIndex, small: &HNSWIndex, ) -> Result<MergeStats>

Merge a small graph into a large graph using IGTM algorithm

Algorithm

1. Compute join set: Find minimal vertex subset that covers all vertices (every vertex has ≥min_coverage neighbors in the join set)
2. Insert join set into large graph using standard insertion
3. For remaining vertices, use join set neighbors as entry points for fast insertion

Arguments

• large - Target graph (will be modified)
• small - Source graph (vectors will be moved)

Returns

Merge statistics including timing breakdown

Trait Implementations

impl Default for GraphMerger

fn default() -> Self

Returns the “default value” for a type.