Struct MemmapGraph 

pub struct MemmapGraph { /* private fields */ }

Memory-mapped graph for extremely large graphs that don’t fit in RAM

Wire format (portable across 32-bit and 64-bit targets)

All integer fields are serialised as little-endian u64 (8 bytes each), even though they are held in memory as usize. This keeps the on-disk layout identical on 32-bit (e.g. wasm32-unknown-unknown) and 64-bit hosts so a graph written on one can be read on the other. The conversion is checked: reading a value that does not fit in this target’s usize returns io::ErrorKind::InvalidData rather than truncating. See issue #125.

Implementations

impl MemmapGraph

pub fn from_csr<P: AsRef<Path>>(csr: &CSRGraph, path: P) -> Result<Self>

Create a new memory-mapped graph from an existing CSR graph

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

Load an existing memory-mapped graph

pub fn neighbors(&mut self, node: usize) -> Result<Vec<(usize, f64)>>

Get neighbors of a node (reads from disk)

pub fn degree(&mut self, node: usize) -> Result<usize>

Get degree of a node

pub fn node_count(&self) -> usize

Get number of nodes

pub fn edge_count(&self) -> usize

Get number of edges

pub fn has_edge(&mut self, from: usize, to: usize) -> Result<bool>

Check if an edge exists (requires reading neighbors)

impl MemmapGraph

Optimized batch operations for memory-mapped graphs

pub fn batch_neighbors( &mut self, nodes: &[usize], ) -> Result<Vec<Vec<(usize, f64)>>>

Read multiple nodes’ neighbors in one operation (more efficient)

pub fn stream_edges<F>(&mut self, callback: F) -> Result<()>

where F: FnMut(usize, usize, f64) -> bool,

Stream through all edges without loading everything into memory

Trait Implementations

impl Debug for MemmapGraph

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

Formats the value using the given formatter.