task-dep-analysis

Finding the critical path for a dev-plan involves analyzing task dependency graphs to calculate weighted execution times. This Skill extracts task edges from metadata and applies deterministic graph processing to compute the critical path and suggest Sprint groupings.

Detecting circular dependencies in a sprint planning task table requires cycle detection on a directed graph. This Skill parses dependency lists and task card depends_on fields to identify blocking cycles and produces structured JSON results indicating cycle status.

Generating a topological sort execution order for task dependencies involves processing a directed acyclic graph. This Skill extracts task edges from sprint tables into a clean DAG and produces a deterministic topological order for dispatch coordination.

Yes, you can use this for sprint planning with dozens of tasks and hidden blockers. The Skill models dependencies from dev-plan task lists to identify what tasks can run in parallel and what must wait, reducing scheduling mistakes.

Task dependency analysis requires dev-plan task tables, dependency text, or task card depends_on fields as input. The Skill extracts these edges into a clean DAG to perform topology checks, cycle detection, and weighted critical path calculation.

A task dependency graph fails to produce an execution order when cycles exist between tasks, preventing a topological sort. The Skill applies cycle detection to identify these blocking loops and returns the cycle status in structured JSON results.