Struct RefGraph 

pub struct RefGraph { /* private fields */ }

A reference graph built from an AgentScript AST.

The graph represents relationships between definitions (topics, actions, variables) and can be used for validation, analysis, and querying.

Implementations

impl RefGraph

pub fn find_usages(&self, target: NodeIndex) -> QueryResult

Find all nodes that use (reference) the given node.

This returns nodes that have outgoing edges pointing to the target.

pub fn find_dependencies(&self, source: NodeIndex) -> QueryResult

Find all nodes that the given node depends on.

This returns nodes that the source has outgoing edges pointing to.

pub fn find_incoming_transitions(&self, topic: NodeIndex) -> QueryResult

Find all topics that transition to the given topic.

pub fn find_outgoing_transitions(&self, topic: NodeIndex) -> QueryResult

Find all topics that the given topic transitions to.

pub fn find_action_invokers(&self, action_def: NodeIndex) -> QueryResult

Find all reasoning actions that invoke the given action definition.

pub fn find_variable_readers(&self, variable: NodeIndex) -> QueryResult

Find all actions that read the given variable.

pub fn find_variable_writers(&self, variable: NodeIndex) -> QueryResult

Find all actions that write to the given variable.

pub fn topic_execution_order(&self) -> Option<Vec<NodeIndex>>

Get a topological ordering of topics (for execution order).

Returns None if there are cycles.

pub fn get_topic_reasoning_actions(&self, topic_name: &str) -> Vec<NodeIndex>

Get all reasoning actions in a topic.

pub fn get_topic_action_defs(&self, topic_name: &str) -> Vec<NodeIndex>

Get all action definitions in a topic.

pub fn stats(&self) -> GraphStats

Get summary statistics about the graph.

impl RefGraph

pub fn validate(&self) -> ValidationResult

Perform full validation of the reference graph.

Returns errors for issues that would cause runtime failures, and warnings for issues that may indicate problems.

pub fn find_cycles(&self) -> Vec<ValidationError>

Find cycles in topic transitions.

Topic transitions should form a DAG. Cycles indicate infinite loops.

pub fn find_unreachable_topics(&self) -> Vec<ValidationError>

Find topics that are unreachable from start_agent.

pub fn find_unused_actions(&self) -> Vec<ValidationError>

Find action definitions that are never invoked.

pub fn find_unused_variables(&self) -> Vec<ValidationError>

Find variables that are never read.

impl RefGraph

pub fn from_ast(ast: &AgentFile) -> Result<Self, GraphBuildError>

Build a reference graph from a parsed AgentScript AST.

This traverses the AST and builds nodes for all definitions, then creates edges for all references between them.

pub fn inner(&self) -> &DiGraph<RefNode, RefEdge>

Get the underlying petgraph for advanced operations.

pub fn get_node(&self, index: NodeIndex) -> Option<&RefNode>

Get a node by its index.

pub fn get_topic(&self, name: &str) -> Option<NodeIndex>

Look up a topic node by name.

pub fn get_action_def(&self, topic: &str, action: &str) -> Option<NodeIndex>

Look up an action definition node by topic and action name.

pub fn get_reasoning_action( &self, topic: &str, action: &str, ) -> Option<NodeIndex>

Look up a reasoning action node by topic and action name.

pub fn get_variable(&self, name: &str) -> Option<NodeIndex>

Look up a variable node by name.

pub fn get_start_agent(&self) -> Option<NodeIndex>

Get the start_agent node index.

pub fn topic_names(&self) -> impl Iterator<Item = &str>

Get all topic names in the graph.

pub fn variable_names(&self) -> impl Iterator<Item = &str>

Get all variable names in the graph.

pub fn node_count(&self) -> usize

Get the number of nodes in the graph.

pub fn edge_count(&self) -> usize

Get the number of edges in the graph.

Trait Implementations

impl Debug for RefGraph

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

Formats the value using the given formatter.

impl From<&RefGraph> for GraphRepr

fn from(graph: &RefGraph) -> Self

Converts to this type from the input type.