Struct MiniGraph 

pub struct MiniGraph { /* private fields */ }

The mini-graph (Java MiniGraph): an in-memory property graph designed to handle a small number of nodes very efficiently (default cap 750).

Implementations

impl MiniGraph

pub fn new() -> Self

Create a mini-graph with the default maximum of 750 nodes.

pub fn with_max_nodes(max_nodes: usize) -> Self

Create a mini-graph with an explicit node cap — be conservative: everything lives in memory and performance decreases as nodes grow.

pub fn get_id(&self) -> &str

The unique id of this mini-graph.

pub fn get_node_count(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn create_root_node(&self) -> Result<Arc<SimpleNode>, AppError>

pub fn create_end_node(&self) -> Result<Arc<SimpleNode>, AppError>

pub fn get_root_node(&self) -> Option<Arc<SimpleNode>>

pub fn get_end_node(&self) -> Option<Arc<SimpleNode>>

pub fn create_node( &self, alias: &str, node_type: &str, ) -> Result<Arc<SimpleNode>, AppError>

Create a node with a unique alias and an initial type.

pub fn remove_node(&self, alias: &str) -> Result<(), AppError>

Remove a node and every connection touching it.

pub fn get_nodes(&self) -> Vec<Arc<SimpleNode>>

pub fn get_connections(&self) -> Vec<Arc<SimpleConnection>>

pub fn reset(&self)

Clear the graph, de-referencing all nodes and connections.

pub fn connect( &self, source_alias: &str, target_alias: &str, ) -> Result<Arc<SimpleConnection>, AppError>

Connect two nodes (idempotent: an existing connection is returned).

pub fn remove_connection( &self, source_alias: &str, target_alias: &str, ) -> Result<(), AppError>

Remove the connection between two nodes (with its relations).

pub fn find_node_by_alias( &self, alias: &str, ) -> Result<Option<Arc<SimpleNode>>, AppError>

Case-insensitive alias lookup. Errors on an empty alias (Java: null).

pub fn find_node_by_id( &self, id: &str, ) -> Result<Option<Arc<SimpleNode>>, AppError>

pub fn find_nodes_by_type( &self, node_type: &str, ) -> Result<Vec<Arc<SimpleNode>>, AppError>

All nodes carrying the given type (case-insensitive).

pub fn find_relation_by_type( &self, relation_type: &str, ) -> Result<Vec<Arc<SimpleRelationship>>, AppError>

All relations of the given type across every connection.

pub fn find_nodes_by_property( &self, key: &str, value: &Value, ) -> Result<Vec<Arc<SimpleNode>>, AppError>

All nodes with a property whose key matches case-insensitively and whose value equals the given one.

pub fn find_connection( &self, source_alias: &str, target_alias: &str, ) -> Result<Option<Arc<SimpleConnection>>, AppError>

pub fn find_bi_directional_connection( &self, source_alias: &str, target_alias: &str, ) -> Result<Vec<Arc<SimpleConnection>>, AppError>

Both directions between two nodes: 0 to 2 connections, forward first.

pub fn get_neighbors( &self, alias: &str, ) -> Result<Vec<Arc<SimpleNode>>, AppError>

Nodes connected in either direction.

pub fn get_forward_links( &self, alias: &str, ) -> Result<Vec<Arc<SimpleNode>>, AppError>

pub fn get_backward_links( &self, alias: &str, ) -> Result<Vec<Arc<SimpleNode>>, AppError>

pub fn find_paths(&self, alias: &str) -> Result<Vec<Vec<String>>, AppError>

BFS level discovery from a node (direction-agnostic): one list of aliases per distance level; unreachable nodes are skipped.

pub fn export_graph(&self) -> Value

Export the graph as a map value: nodes sorted by alias, connections by source:target, relations by type — deterministic for round-tripping.

pub fn import_graph(&self, map: &Value) -> Result<(), AppError>

Import a graph map (the export shape). The graph resets first; an invalid payload leaves it empty (Java parity).

pub fn same_as(&self, that: &MiniGraph) -> bool

Structural equality with another graph: same nodes (aliases, types, deep-equal properties) and same connections/relations.

pub fn to_json(&self) -> String

Export as a JSON string (deterministic ordering).

Trait Implementations

impl Default for MiniGraph

fn default() -> Self

Returns the “default value” for a type.