Struct GraphAdjacencyIndex 

pub struct GraphAdjacencyIndex { /* private fields */ }

Graph adjacency index for fast edge/neighbor lookups

Supports O(1) lookups for:

• All outgoing edges from a node
• All incoming edges to a node
• Edges filtered by label

Implementations

impl GraphAdjacencyIndex

pub fn new() -> GraphAdjacencyIndex

Create a new empty adjacency index

pub fn index_edge( &self, edge_id: EntityId, source_id: EntityId, target_id: EntityId, label: &str, weight: f32, )

Index an edge for fast lookups

pub fn remove_edge(&self, edge_id: EntityId)

Remove an edge from the index

pub fn get_neighbors( &self, node_id: EntityId, direction: EdgeDirection, label_filter: Option<&str>, ) -> Vec<AdjacencyEntry>

Get neighbors in a direction (optionally filtered by label)

pub fn get_edges_by_label(&self, label: &str) -> Vec<EntityId>

Get all edges with a specific label

pub fn out_degree(&self, node_id: EntityId) -> usize

Get outgoing degree of a node

pub fn in_degree(&self, node_id: EntityId) -> usize

Get incoming degree of a node

pub fn degree(&self, node_id: EntityId) -> usize

Get total degree of a node

pub fn edge_count(&self) -> usize

Get edge count

pub fn node_count(&self) -> usize

Get node count

pub fn clear(&self)

Clear the entire index

Trait Implementations

impl Default for GraphAdjacencyIndex

fn default() -> GraphAdjacencyIndex

Returns the “default value” for a type.