Struct Validator 

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

Validator for graph integrity.

Implementations

impl<'a> Validator<'a>

pub fn new(graph: &'a Graph) -> Self

pub fn validate(&self) -> ValidationResult

Run all validations and return combined result.

pub fn find_orphan_nodes(&self) -> Vec<String>

Find nodes that have no edges (neither incoming nor outgoing).

pub fn find_missing_refs(&self) -> Vec<MissingRef>

Find edges that reference non-existent nodes.

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

Find cycles in the graph using Tarjan’s SCC algorithm. By default checks depends_on edges. Any SCC with size > 1 is a cycle.

pub fn find_cycles_for_relations(&self, relations: &[&str]) -> Vec<Vec<String>>

Find cycles considering specific edge relations.

pub fn find_duplicate_nodes(&self) -> Vec<String>

Find duplicate node IDs.

pub fn find_duplicate_edges(&self) -> Vec<DuplicateEdge>

Find duplicate edges (same from, to, relation).

pub fn find_self_edges(&self) -> Vec<SelfEdge>

Find self-referential edges (from == to).

pub fn would_create_cycle(&self, from: &str, to: &str) -> bool

Check if adding an edge would create a cycle.