Struct GraphProjection 

pub struct GraphProjection { /* private fields */ }

A projected view of a graph

Projections are lightweight copies optimized for algorithm execution. They don’t modify the original graph.

Implementations

impl GraphProjection

pub fn native( graph: &GraphStore, node_filter: NodeFilter, edge_filter: EdgeFilter, property_projection: PropertyProjection, aggregation: AggregationStrategy, ) -> Self

Create a native projection from a graph with filters

pub fn from_nodes(graph: &GraphStore, node_ids: &[String]) -> Self

Create a projection from a list of node IDs (induced subgraph)

pub fn from_paths(graph: &GraphStore, paths: &[Vec<String>]) -> Self

Create a projection from traversal path results

pub fn undirected( graph: &GraphStore, node_filter: NodeFilter, edge_filter: EdgeFilter, ) -> Self

Create an undirected projection (each edge becomes bidirectional)

pub fn stats(&self) -> &ProjectionStats

Get projection statistics

pub fn node_count(&self) -> usize

Get number of nodes

pub fn edge_count(&self) -> usize

Get number of edges

pub fn get_node(&self, id: &str) -> Option<&ProjectedNode>

Get a node by ID

pub fn has_node(&self, id: &str) -> bool

Check if node exists

pub fn iter_nodes(&self) -> impl Iterator<Item = &ProjectedNode>

Iterate over all nodes

pub fn node_ids(&self) -> impl Iterator<Item = &String>

Get node IDs

pub fn outgoing(&self, node_id: &str) -> &[(String, String, f32)]

Get outgoing edges from a node (target_id, edge_label, weight).

pub fn incoming(&self, node_id: &str) -> &[(String, String, f32)]

Get incoming edges to a node (source_id, edge_label, weight).

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

Get out-degree of a node

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

Get in-degree of a node

pub fn neighbors(&self, node_id: &str) -> Vec<&str>

Get neighbors (outgoing targets)

pub fn neighbors_weighted(&self, node_id: &str) -> Vec<(&str, f32)>

Get neighbors with weights

pub fn all_neighbors(&self, node_id: &str) -> HashSet<&str>

Get all neighbors (both directions)