Expand description
Project-graph traversal and topology methods.
This module extends graph::Project
with traversal and accessor methods. The core operation is a DFS-based
topological sort that produces a deployment-safe ordering where every
dependency precedes its dependents. External dependencies are excluded
from traversal. A cycle produces
DependencyError::CircularDependency.
Accessor methods (iter_objects, find_object, get_tables) flatten the
database > schema > object hierarchy into simple iterators.