pub struct DependencyGraph {
pub edges: BTreeMap<String, Vec<String>>,
pub nodes: BTreeSet<String>,
pub topo_order: Vec<String>,
pub cycles: Vec<Vec<String>>,
}Expand description
A dependency graph of contracts.
Fields§
§edges: BTreeMap<String, Vec<String>>Map from contract stem to its direct dependencies.
nodes: BTreeSet<String>All unique contract stems in the graph.
topo_order: Vec<String>Topological ordering (empty if cycle detected).
cycles: Vec<Vec<String>>Detected cycles (empty if DAG is valid).
Trait Implementations§
Source§impl Clone for DependencyGraph
impl Clone for DependencyGraph
Auto Trait Implementations§
impl Freeze for DependencyGraph
impl RefUnwindSafe for DependencyGraph
impl Send for DependencyGraph
impl Sync for DependencyGraph
impl Unpin for DependencyGraph
impl UnsafeUnpin for DependencyGraph
impl UnwindSafe for DependencyGraph
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more