Struct GraphValidator 

pub struct GraphValidator<'a> { /* private fields */ }

Graph validator for span relationships

Implementations

impl<'a> GraphValidator<'a>

pub fn new(spans: &'a [SpanData]) -> Self

Create a new GraphValidator

pub fn validate_edge_exists( &self, parent_name: &str, child_name: &str, ) -> Result<()>

Validate that at least one edge exists between parent_name and child_name

Arguments

• parent_name - Name of parent span
• child_name - Name of child span

Returns

• Result<()> - Ok if edge exists, error otherwise

Errors

• Parent span not found
• Child span not found
• No edge found between parent and child

pub fn validate_edge_not_exists( &self, parent_name: &str, child_name: &str, ) -> Result<()>

Validate that NO edge exists between parent_name and child_name

Arguments

• parent_name - Name of parent span
• child_name - Name of child span

Returns

• Result<()> - Ok if edge does NOT exist, error if it does

Errors

• Forbidden edge was found

pub fn validate_acyclic(&self) -> Result<()>

Validate that the span graph is acyclic (no cycles)

Uses depth-first search with visited tracking to detect cycles.

Returns

• Result<()> - Ok if acyclic, error if cycle detected

Errors

• Cycle detected in graph

pub fn get_all_edges(&self) -> Vec<(String, String)>

Get all edges in the graph as (parent_name, child_name) pairs