skills.rest
Pact-Community-Organization
Pact-Community-OrganizationOFFICIAL
Explore all skills by this author →
Website𝕏@PactCommOrgGitHub

dependency-resolution

Detect cycles and plan critical paths for multi-agent task dependencies.

1|1|Updated Jun 9, 2026
Search Tags:#workflow#task#dependency#critical-path#topological-sort#cycle-detection#deadlock-prevention
One-click install
npx skills add https://github.com/Pact-Community-Organization/github-marketplace --skill dependency-resolution
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: dependency-resolution
Source: https://github.com/Pact-Community-Organization/github-marketplace/tree/main/skills/dependency-resolution
Command: npx skills add https://github.com/Pact-Community-Organization/github-marketplace --skill dependency-resolution

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Track and coordinate tasks across multi-agent workflows by modeling dependencies, detecting cycles, and identifying paths to prevent deadlocks.

Core Features & Use Cases

  • Cycle detection for task graphs using adjacency lists and topological sort.
  • Critical path analysis to prioritize hard dependencies and optimize parallel work.
  • Blocked task handling with escalation to Admin when blockers persist across cycles.
  • Gate, hard, and soft dependency support for flexible coordination in agent systems.

Quick Start

Identify a set of tasks and their dependencies, then invoke the dependency-resolution skill to validate the graph and output a recommended execution plan.

Frequently Asked Questions about dependency-resolution

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

FAQPage Schema
How do I prevent deadlocks when managing task dependencies in multi-agent workflows?▼

To prevent deadlocks in multi-agent workflows, you need to model task dependencies, detect cycles using topological sort, and identify the critical path to schedule execution safely.

What is the best way to identify the critical path for tasks with hard and soft dependencies?▼

Identifying the critical path for tasks with hard, soft, and gate dependencies requires longest-path analysis on a constructed adjacency list to prioritize hard dependencies and optimize parallel work.

How do you handle blocked tasks when persistent blockers occur across execution cycles?▼

Handling blocked tasks involves tracking persistent blockers across execution cycles and triggering an escalation protocol to Admin when tasks remain blocked and cannot proceed.

Can I use cycle detection for task graphs that include gate dependencies?▼

Yes, cycle detection for task graphs applies to workflows containing hard, soft, and gate dependencies, validating the graph structure before generating a recommended execution plan.

How do I start mapping task dependencies to generate a valid execution plan?▼

Start mapping task dependencies by identifying your task set and their relationships, then invoke a dependency-resolution process to validate the graph and output a recommended execution plan.

Related Skills

Explore More Software Engineering Skills→
KakiseKakise
1

kitty:explore

Construct a navigable graph of modules, imports, definitions, and relationships.

Community
Intermediate
martin-jancimartin-janci
3

executing-plans

Execute implementation plans in controlled batches with review checkpoints.

Community
Advanced
eroslifestyleeroslifestyle
1

multi-plan

Decompose complex tasks into parallel subtasks with dependencies and agent assignments.

Community
Advanced
ricablericable
1

@ruvector/rudag

Perform topological sorting, critical path analysis, and dependency resolution on DAGs in Rust/WASM.

Community
Intermediate