Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Represents the dependency graph for circular dependency detection

Implementations

impl DependencyGraph

pub fn new() -> Self

Create a new empty dependency graph.

pub fn add_edge(&mut self, parent: ScenarioReference, child: ScenarioReference)

Add a dependency edge from parent to child

pub fn detect_cycles( &self, start: &ScenarioReference, ) -> Result<(), Vec<ScenarioReference>>

Detect circular dependencies using depth-first search Returns Ok(()) if no cycles, or Err with the cycle path if a cycle is detected

pub fn format_cycle_error(cycle: &[ScenarioReference]) -> String

Format a cycle path as a human-readable error message

Trait Implementations

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.