Struct SerializedGraph

pub struct SerializedGraph {
    pub m: usize,
    pub num_nodes: usize,
    pub entry_point: Option<u32>,
    pub max_level: usize,
    pub vectors: Vec<f32>,
    pub dim: usize,
    pub neighbors: Vec<u32>,
}

Serialized HNSW graph for persistence.

Contains all data needed to reconstruct the graph.

Fields

m: usize

Configuration.

num_nodes: usize

Number of nodes.

entry_point: Option<u32>

Entry point node ID.

max_level: usize

Maximum level in the graph.

vectors: Vec<f32>

All vectors (flattened: [node_0_dim_0, node_0_dim_1, ..., node_1_dim_0, ...]).

dim: usize

Vector dimensionality.

neighbors: Vec<u32>

Neighbor lists: [node_0_level_0, node_0_level_1, ..., node_1_level_0, ...] Encoded as: for each node, number of levels, then for each level, count + neighbor IDs.

Trait Implementations

impl Clone for SerializedGraph

fn clone(&self) -> SerializedGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SerializedGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SerializedGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for SerializedGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.