use crate;
/// Represents the graph of dependencies between module items and items they
/// reference, either in the same module, or via imports.
///
/// The dependency graph is used to construct the final [Program] representation,
/// containing only those parts of the program which are referenced from the root
/// module.
pub type DependencyGraph = DiGraphMap;
/// Represents the graph of dependencies between modules, with no regard to what
/// items in those modules are actually used. In other words, this graph tells us
/// what modules depend on what other modules in the program.
pub type ModuleGraph = DiGraphMap;
/// Represents the type of edges in the dependency graph