Converts a software project specification into a dependency-aware task blueprint with ordered subtasks.
npx skills add https://github.com/arbazkhan971/godmode --skill plan-arbazkhan971
Please help me install this Agent Skill. Skill: plan Source: https://github.com/arbazkhan971/godmode/tree/main/skills/plan Command: npx skills add https://github.com/arbazkhan971/godmode --skill plan-arbazkhan971
Transforms a project specification into a dependency-aware task blueprint that is ready for implementation.
Feed the spec and output a topologically sorted list of tasks with IDs, titles, dependencies, and required files.
High-intent search queries and answers about installing and using this skill.
To decompose a software specification into an ordered task list, feed the spec into the planner to generate discrete tasks with IDs, titles, dependencies, and required files in a topologically sorted sequence.
A topological dependency graph for software task planning is a directed structure that maps task prerequisites to optimize parallel work and prevent circular dependencies during implementation.
To structure engineering tasks and avoid circular dependencies, the planner enforces constraints by building a topological graph that orders tasks sequentially and prevents cycles before implementation begins.
When decomposing a project specification, the planner enforces strict file limits by allowing a maximum of 5 files per task and requiring exactly one task per file.
Yes, you can plan tasks for both UI and API components from a single spec, as the planner decomposes specifications across data, API, UI, config, and test layers into an executable blueprint.
Task decomposition enforces one task per file to maintain strict boundaries, ensuring tasks remain granular, manageable for engineers and QA, and aligned with the topological dependency graph.
RamonsDkaDocument frontend data needs, user actions, and UI states for backend developers.
riezDispatch specialized agents for independent tasks with two-stage reviews.
ricablePerform topological sorting, critical path analysis, and dependency resolution on DAGs in Rust/WASM.
darelabs-techExecute DAG-defined software development tasks with topological sorting and Ralph Loop quality gates.
