Struct DependencyGraph 

pub struct DependencyGraph {
    pub nodes: HashMap<String, InstallNode>,
    pub adj: HashMap<String, HashSet<String>>,
}

A Directed Acyclic Graph (DAG) representing the installation plan.

The graph ensures that dependencies are installed before the packages that require them. The $root node acts as the entry point linking all direct user requests.

Fields

nodes: HashMap<String, InstallNode>

A map of package IDs to their complete installation data.

adj: HashMap<String, HashSet<String>>

The adjacency list representing the directed edges (dependencies) between packages.

Implementations

impl DependencyGraph

pub fn new() -> DependencyGraph

Creates a new, empty DependencyGraph.

pub fn toposort(&self) -> Result<Vec<Vec<String>>, Error>

Performs a topological sort of the graph, returning packages grouped into installation stages.

Packages with no dependencies (leaf nodes) appear in the first stage, followed by packages that only depend on those in the first stage, and so on. This ensures that dependencies are always installed before their dependents.

Errors

Returns an error if a cycle is detected in the dependency graph or if there’s an internal inconsistency in the graph structure.

Trait Implementations

impl Debug for DependencyGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for DependencyGraph

fn default() -> DependencyGraph

Returns the “default value” for a type.