Struct CsrMmapGraph 

pub struct CsrMmapGraph {
    pub node_count: usize,
    pub edge_count: usize,
    pub vector_dim: usize,
    pub flags: u32,
    /* private fields */
}

Memory-mapped CSR graph reader with safe unaligned loads.

Fields

node_count: usize

Number of nodes in the CSR graph.

edge_count: usize

Number of edges.

vector_dim: usize

Embedding dimension (0 when no vectors are stored).

flags: u32

Header flags bitfield.

Implementations

impl CsrMmapGraph

pub fn open<P: AsRef<Path>>(path: P) -> Result<Self>

Open and fully validate a graph.mmap file.

pub fn node_id(&self, idx: usize) -> Option<&str>

Look up the node id string for a CSR index.

pub fn index_of(&self, id: &str) -> Option<u32>

Look up the CSR index for a node id.

pub fn node_ids(&self) -> &[String]

All node ids in CSR index order.

pub fn get_neighbors(&self, node_idx: usize) -> (Vec<u32>, Vec<f32>)

Graph neighbors as owned vectors (safe, allocation per call).

pub fn k_hop_neighborhood( &self, start_node_idx: usize, k: usize, ) -> Vec<(u32, f32)>

k-hop neighborhood with multiplicative path weights (first visit wins).

pub fn get_vector(&self, node_idx: usize) -> Option<Vec<f32>>

Copy out the vector row for node_idx (None if no vectors).

pub fn dot_product(a: &[f32], b: &[f32]) -> f32

Dot product with an unrolled loop (may auto-vectorize; not explicit SIMD).

pub fn top_k_vector_search( &self, query_vector: &[f32], top_k: usize, ) -> Vec<(u32, f32)>

Full scan top-k by dot product (acceptable for small N in v0.1).

Trait Implementations

impl Debug for CsrMmapGraph

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

Formats the value using the given formatter.