Struct CsrAdjacency 

pub struct CsrAdjacency { /* private fields */ }

Read-optimized compressed sparse row adjacency for graph traversal.

Memory layout for N entities with E total edges:

• Forward: row_offsets[N+1] + targets[E] + edge_tags[E]
• Reverse: separate CSR indexed by target ref_val

refs_from(eid) is a single slice: targets[row_offsets[eid]..row_offsets[eid+1]]

Implementations

impl CsrAdjacency

pub fn from_ref_adjacency(adj: &RefAdjacency, max_entity_id: usize) -> Self

Build a CSR snapshot from the mutable HashMap-based adjacency.

pub fn targets_from( &self, entity_id: usize, ref_type: Option<&str>, ) -> Vec<String>

Get target ref values from an entity, optionally filtered by ref type.

Returns a contiguous slice view (no allocation for unfiltered case).

pub fn sources_to( &self, target_ref_val: &str, ref_type: Option<&str>, ) -> Vec<usize>

Get source entity ids that reference target_ref_val, optionally filtered by ref type.

pub fn targets_from_patched( &self, entity_id: usize, ref_type: Option<&str>, patch: &CsrPatch, ) -> Vec<String>

Get targets from an entity, overlaying a patch buffer.

pub fn sources_to_patched( &self, target_ref_val: &str, ref_type: Option<&str>, patch: &CsrPatch, ) -> Vec<usize>

Get source entity IDs that reference target, overlaying a patch buffer.

pub fn edge_count(&self) -> usize

Total number of forward edges stored.