skills.rest
curiositech
curiositechOFFICIAL
Explore all skills by this author →
WebsiteGitHub

dag-dependency-resolver

Validate directed acyclic graphs and produce topological orders with cycle reports.

10|1|Updated Mar 17, 2026
Search Tags:#dag#parallel-execution#topological-sort#dependency-resolution#cycle-detection#kahn
One-click install
npx skills add https://github.com/curiositech/windags-skills --skill dag-dependency-resolver
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: dag-dependency-resolver
Source: https://github.com/curiositech/windags-skills/tree/main/skills/dag-dependency-resolver
Command: npx skills add https://github.com/curiositech/windags-skills --skill dag-dependency-resolver

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

DAG graphs often become invalid due to cycles or incorrect execution order, causing delays and brittle pipelines.

Core Features & Use Cases

  • Cycle detection, topological sorting, and dependency validation for directed acyclic graphs (DAGs).
  • Conflict resolution and optimization for parallel execution in build systems, data pipelines, and task orchestrations.
  • Use case: validate a DAG, identify cycles, compute an execution waves plan, and suggest remediation steps.

Quick Start

Validate with a simple DAG and request an ordered execution plan.

Frequently Asked Questions about dag-dependency-resolver

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I detect cycles in a directed acyclic graph?▼

Cycle detection in a directed acyclic graph is performed using Kahn's algorithm, which identifies circular dependencies during topological sorting and generates a detailed cycle report for remediation.

What is the best way to resolve dependencies for parallel execution in build systems?▼

Dependency resolution for parallel execution is achieved by computing an optimal topological order, organizing tasks into execution waves that validate inputs and optimize pipeline scheduling.

How does topological sorting work for data pipeline task orchestration?▼

Topological sorting for data pipeline orchestration works by applying Kahn's algorithm to linearly order tasks based on their dependencies, ensuring every task executes only after its prerequisites complete.

Can I validate DAG inputs and check for conflict resolution errors before scheduling?▼

DAG validation includes input and output checks alongside conflict-resolution verification, ensuring directed acyclic graphs are structurally correct and free of scheduling conflicts before execution begins.

Why does my DAG execution fail due to incorrect task ordering?▼

DAG execution fails when incorrect task ordering introduces circular dependencies or violates prerequisite sequences, requiring topological sorting and cycle detection to validate the graph and suggest remediation steps.

Related Skills

Explore More Software Engineering Skills→
jonathan-vellajonathan-vella
50

workflow-engine

Define machine-readable DAGs for orchestrating multi-agent workflows.

Community
Advanced
krzemienskikrzemienski
2

wave-orchestration

Transforms sequential multi-agent execution into parallel waves with dependency analysis and synthesis checkpoints.

Community
Advanced
shiroinockshiroinock

tdd-next

Coordinate TDD task orchestration from GitHub issue selection to PR completion.

Community
Advanced
kriscendobotkriscendobot
3

pr-dependency-graph

Parse PR dependency registries into adjacency lists for topological sorting and cycle detection.

Community
Intermediate