Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Dependency graph for type compilation order

Tracks dependencies between types and provides topological sorting to determine the correct compilation order.

Implementations

impl DependencyGraph

pub fn new() -> Self

Create a new empty dependency graph

pub fn add_type(&mut self, type_key: TypeKey)

Add a type to the graph (without dependencies)

pub fn add_dependency(&mut self, derived: TypeKey, base: TypeKey)

Add a type dependency (derived_type depends on base_type)

This means base_type must be compiled before derived_type.

pub fn type_count(&self) -> usize

Get the number of types in the graph

pub fn edge_count(&self) -> usize

Get the number of dependency edges in the graph

pub fn has_dependencies(&self, type_key: TypeKey) -> bool

Check if a type has any dependencies

pub fn get_dependencies(&self, type_key: TypeKey) -> &[TypeKey]

Get the dependencies of a type

pub fn sort(&mut self) -> SchemaResult<()>

Perform topological sort and cycle detection using Kahn’s algorithm

After successful sorting, use compilation_order() to get types in the order they should be compiled (dependencies first).

Errors

Returns an error if a circular dependency is detected.

pub fn compilation_order(&self) -> &[TypeKey]

Get types in compilation order (dependencies first)

Must call sort() first or this will return an empty slice.

pub fn has_cycle(&self) -> bool

Check if the graph contains a cycle

Trait Implementations

impl Debug for DependencyGraph

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

Formats the value using the given formatter.

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.