Struct DependencyGraph 

pub struct DependencyGraph {
    pub nodes: HashMap<String, DependencyNode>,
    pub edges: Vec<DependencyEdge>,
}

Built dependency graph.

Fields

nodes: HashMap<String, DependencyNode>

edges: Vec<DependencyEdge>

Implementations

impl DependencyGraph

pub fn build(store: &CatalogStore) -> Self

Build the graph from a loaded CatalogStore.

pub fn upstream(&self, asset_id: &str) -> Vec<&DependencyEdge>

All edges that originate from asset_id — i.e. what asset_id depends on.

pub fn downstream(&self, asset_id: &str) -> Vec<&DependencyEdge>

All edges that point to asset_id — i.e. what depends on asset_id.

pub fn upstream_ids(&self, asset_id: &str) -> Vec<String>

Convenience: sorted list of IDs that asset_id depends on (upstream nodes).

pub fn downstream_ids(&self, asset_id: &str) -> Vec<String>

Convenience: sorted list of IDs that depend on asset_id (downstream nodes).

pub fn blast_radius(&self, asset_id: &str) -> BlastRadius

Transitive blast-radius: which assets break if asset_id is removed?

Walks backwards through the graph (BFS over downstream edges) and returns every transitive dependent, sorted and deduplicated.

pub fn find_cycles(&self) -> Vec<Vec<String>>

Detect all cycles in the graph using iterative DFS.

Returns a list of cycles where each cycle is represented as an ordered list of node IDs forming the cycle path. The result is deterministically sorted so tests can make stable assertions.

pub fn render_ascii_tree(&self, focus_id: &str, max_depth: usize) -> String

Render an ASCII dependency tree rooted at focus_id.

Each level is indented by 2 spaces per depth. Nodes already visited in the current path are marked [cycle] to avoid infinite output.

pub fn to_adjacency_json(&self) -> Value

Export graph as a JSON adjacency list suitable for --report dependencies.

Shape:

{
  "nodes": [ { "id": "...", "asset_type": "..." }, ... ],
  "adjacency": {
    "<id>": [ { "to": "...", "edge_type": "depends-on" }, ... ],
    ...
  }
}