Struct ChunkedAdjacency 

pub struct ChunkedAdjacency { /* private fields */ }

Chunked adjacency lists with delta buffers.

This is the primary structure for storing edge connectivity. It supports efficient insertion, deletion (via tombstones), and sequential scanning.

Implementations

impl ChunkedAdjacency

pub fn new() -> Self

Creates a new chunked adjacency structure.

pub fn with_chunk_capacity(capacity: usize) -> Self

Creates a new chunked adjacency with custom chunk capacity.

pub fn add_edge(&self, src: NodeId, dst: NodeId, edge_id: EdgeId)

Adds an edge from src to dst.

pub fn mark_deleted(&self, src: NodeId, edge_id: EdgeId)

Marks an edge as deleted.

pub fn neighbors(&self, src: NodeId) -> Vec<NodeId>

Returns all neighbors of a node.

Note: This allocates a Vec to collect neighbors while the internal lock is held, then returns the Vec. For traversal performance, consider using edges_from if you also need edge IDs, to avoid multiple lookups.

pub fn edges_from(&self, src: NodeId) -> Vec<(NodeId, EdgeId)>

Returns all (neighbor, edge_id) pairs for outgoing edges from a node.

Note: This allocates a Vec to collect edges while the internal lock is held, then returns the Vec. This is intentional to avoid holding the lock across iteration.

pub fn out_degree(&self, src: NodeId) -> usize

Returns the out-degree of a node.

pub fn compact(&self)

Compacts all adjacency lists.

pub fn compact_if_needed(&self)

Compacts delta buffers that exceed the threshold.

pub fn total_edge_count(&self) -> usize

Returns the total number of edges (including deleted).

pub fn active_edge_count(&self) -> usize

Returns the number of active (non-deleted) edges.

pub fn node_count(&self) -> usize

Returns the number of nodes with adjacency lists.

pub fn clear(&self)

Clears all adjacency lists.

Trait Implementations

impl Default for ChunkedAdjacency

fn default() -> Self

Returns the “default value” for a type.