Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Implementations

impl DependencyGraph

pub fn build(metas: &HashMap<TypeId, EntityTypeMeta>) -> Self

Builds the graph from entity metadata. Edges come from HasMany and ManyToMany navigations: related_type_id (child) depends on type_id (principal).

pub fn topological_sort(&self) -> Vec<TypeId>

Kahn’s algorithm topological sort: principals first, dependents after. Self-edges (type depends on itself) are excluded from in-degree counting — same-type instance ordering is handled by the cascade drain + fixup pipeline.

pub fn deletion_order(&self) -> Vec<TypeId>

Deletion order: reverse topological (dependents before principals).