Struct SimpleGraph 

pub struct SimpleGraph {
    pub edges: HashMap<NodeId, Vec<NodeId>>,
    pub labels: HashMap<NodeId, String>,
}

A lightweight directed-graph descriptor used by the evaluator layer.

This is a plain data structure — it does not own Node trait objects. Use FilterGraph from crate::graph for full node execution.

Fields

edges: HashMap<NodeId, Vec<NodeId>>

Adjacency list: source NodeId → list of successor NodeIds.

labels: HashMap<NodeId, String>

Node labels for serialization and diagnostics.

Implementations

impl SimpleGraph

pub fn new() -> Self

Create a new empty graph descriptor.

pub fn add_node(&mut self, id: NodeId, label: impl Into<String>)

Add a node with a label.

pub fn add_edge(&mut self, from: NodeId, to: NodeId)

Add a directed edge (implicitly creates both nodes if absent).

pub fn node_count(&self) -> usize

Return the number of nodes.

pub fn edge_count(&self) -> usize

Return the number of directed edges.

pub fn node_ids(&self) -> Vec<NodeId>

Return all node IDs sorted for determinism.

Trait Implementations

impl Clone for SimpleGraph

fn clone(&self) -> SimpleGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SimpleGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for SimpleGraph

fn default() -> SimpleGraph

Returns the “default value” for a type.