Struct move_bytecode_utils::dependency_graph::DependencyGraph

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

Directed graph capturing dependencies between modules

Implementations

impl<'a> DependencyGraph<'a>

pub fn new(module_iter: impl IntoIterator<Item = &'a CompiledModule>) -> Self

Construct a dependency graph from a set of modules. Panics if modules contains duplicates or is not closed under the depedency relation

pub fn compute_topological_order( &self ) -> Result<impl Iterator<Item = &CompiledModule>>

Return an iterator over the modules in self in topological order–modules with least deps first. Fails with an error if self contains circular dependencies