Struct DependencyGraph 

pub struct DependencyGraph { /* private fields */ }

Directed acyclic graph tracking issue dependencies.

Edges point from dependent to dependency: if A depends on B, edges[A] contains B. The graph enforces acyclicity on insertion.

Implementations

impl DependencyGraph

pub fn new(session_id: &str) -> Self

pub fn session_id(&self) -> &str

pub fn contains(&self, issue: u32) -> bool

pub fn node(&self, issue: u32) -> Option<&GraphNode>

pub fn node_count(&self) -> usize

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

pub fn add_edge(&mut self, from: u32, to: u32) -> bool

Add a dependency edge: from depends on to.

Returns false if the edge would create a cycle (edge not added).

pub fn would_create_cycle(&self, from: u32, to: u32) -> bool

Check if adding an edge from -> to would create a cycle.

A cycle exists if to transitively depends on from.

pub fn ready_issues(&self) -> Vec<u32>

Issues in Pending state whose dependencies are all Merged.

pub fn awaiting_merge(&self) -> Vec<u32>

Issues currently in AwaitingMerge state.

pub fn transition(&mut self, issue: u32, state: NodeState)

Transition a node to a new state.

pub fn set_pr_number(&mut self, issue: u32, pr_number: u32)

Set the PR number on a node.

pub fn set_run_id(&mut self, issue: u32, run_id: &str)

Set the run ID on a node.

pub fn dependencies(&self, issue: u32) -> HashSet<u32>

Get the set of issues that issue depends on.

pub fn dependents(&self, issue: u32) -> HashSet<u32>

Get the set of issues that depend on issue.

pub fn all_terminal(&self) -> bool

Whether every node is in a terminal state (Merged or Failed).

pub fn is_blocked(&self, issue: u32) -> bool

Whether a node is blocked because at least one dependency has failed.

pub fn propagate_failure(&mut self, issue: u32) -> Vec<u32>

Propagate failure from a node to all transitive dependents.

Any Pending or InFlight node reachable via reverse_edges from the failed node is transitioned to Failed. Returns the list of issue numbers that were newly failed (excludes the original node).

pub fn remove_node(&mut self, issue: u32)

Remove a node and all its edges (for stale issue cleanup).

pub fn all_issues(&self) -> Vec<u32>

All issue numbers in the graph.

pub fn from_db(conn: &Connection, session_id: &str) -> Result<Self>

Load graph state from the database.

pub fn save_to_db(&self, conn: &Connection) -> Result<()>

Persist the full graph state to the database, replacing any existing data for this session. Runs inside a transaction so a crash mid-save cannot leave a partial graph.

pub fn from_planner_output( session_id: &str, plan: &PlannerGraphOutput, issues: &[PipelineIssue], ) -> Self

Build a graph from planner output, matching issues by number.

pub fn merge_planner_output( &mut self, plan: &PlannerGraphOutput, issues: &[PipelineIssue], )

Merge new planner output into an existing graph (polling mode).

Only adds nodes not already present. Edges between new nodes and existing nodes are added if they don’t create cycles.

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

Render a layered box-drawing DAG visualization for terminal output.

pub fn to_graph_context(&self) -> Vec<GraphContextNode>

Build planner context from the current graph state.

Produces one GraphContextNode per node so the planner can see in-flight work and avoid scheduling conflicts.