Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Dependency graph for tracking type dependencies

Implementations

impl DependencyGraph

pub fn new() -> Self

pub fn add_node(&mut self, node: TypeNode)

Add a node to the graph

pub fn add_dependency(&mut self, from: TypeNode, to: TypeNode)

Add a dependency edge: from depends on to

pub fn dependencies_of(&self, node: &TypeNode) -> Option<&HashSet<TypeNode>>

Get all direct dependencies of a node

pub fn dependents_of(&self, node: &TypeNode) -> Option<&HashSet<TypeNode>>

Get all nodes that depend on the given node

pub fn topological_sort(&self) -> Result<Vec<TypeNode>, CycleError>

Perform topological sort on the graph Returns nodes in dependency order (dependencies come before dependents)

pub fn transitive_dependencies(&self, node: &TypeNode) -> HashSet<TypeNode>

Get all transitive dependencies of a node

pub fn has_path(&self, from: &TypeNode, to: &TypeNode) -> bool

Check if there’s a path from from to to

Trait Implementations

impl Default for DependencyGraph

fn default() -> Self

Returns the “default value” for a type.