Struct RepoDependencyGraph 

pub struct RepoDependencyGraph { /* private fields */ }

Directed dependency graph over RepoNodes.

Edges are stored as dependency → dependents adjacency lists. Cycles are detected at insertion time via DFS.

Implementations

impl RepoDependencyGraph

pub fn new() -> Self

Create an empty graph.

pub fn add_node(&mut self, node: RepoNode)

Register a RepoNode. Idempotent — re-registering an existing id updates the node metadata.

pub fn add_dependency( &mut self, dependency: &str, dependent: &str, ) -> MultiRepoResult<()>

Add a directed dependency edge: dependent depends on dependency.

Both nodes must already be registered via [add_node]. Returns MultiRepoError::DependencyCycle if the edge would introduce a cycle (checked via DFS before the edge is committed). Returns MultiRepoError::RepoNotFound if either node is absent.

pub fn topological_order(&self) -> MultiRepoResult<Vec<RepoNode>>

Return repos in topological order (dependencies before dependents).

Uses Kahn’s algorithm. Returns MultiRepoError::DependencyCycle if a cycle is present (should not occur if add_dependency is used).

pub fn dependencies_of(&self, repo_id: &str) -> MultiRepoResult<Vec<&RepoNode>>

Return all direct dependencies of repo_id (repos it depends on).

pub fn dependents_of(&self, repo_id: &str) -> MultiRepoResult<Vec<&RepoNode>>

Return all direct dependents of repo_id (repos that depend on it).

pub fn transitive_dependents_of( &self, repo_id: &str, ) -> MultiRepoResult<Vec<String>>

All transitive dependents of repo_id (BFS over downstream edges).

pub fn to_execution_plan( &self, title: &str, ) -> MultiRepoResult<RepoExecutionPlan>

Convert to a RepoExecutionPlan by running topological sort and grouping same-level repos as parallelizable steps.

Two steps are in the same “level” if they share exactly the same set of transitive upstream dependencies. We approximate this by tracking which Kahn wave each node belongs to.

Trait Implementations

impl Clone for RepoDependencyGraph

fn clone(&self) -> RepoDependencyGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RepoDependencyGraph

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

Formats the value using the given formatter.

impl Default for RepoDependencyGraph

fn default() -> RepoDependencyGraph

Returns the “default value” for a type.