Task DAG Dependency Resolver

Task DAG Dependency Resolver MCP Connector for Claude

A+

Resolves task execution order and parallel groups from DAG dependencies.

3 tools Official Updated Oct 1, 2026 Official Vinkius Partner

This MCP server provides advanced graph mathematics for agentic orchestration. It uses Kahn's algorithm to calculate valid execution sequences and identify tasks that can run in parallel. Use resolve_execution_order to get a full execution plan, detect_cycles to find deadlocks in your pipeline, or find_isolated_tasks to identify disconnected nodes. It is designed for managing complex task dependencies in frameworks like CrewAI or LangGraph.

dagtopological-sortdependency-resolveragent-orchestrationgraph-math

3 tools expose this connector's capabilities to your AI agent.

find_isolated_tasks

Identifies tasks that are completely disconnected from the rest of the execution graph

resolve_execution_order

Calculates the valid execution sequence and parallel execution groups for a set of tasks

detect_cycles

Specifically focuses on finding and describing the exact loop causing a deadlock in the pipeline

See how to talk to your AI agent using Task DAG Dependency Resolver.

Calculate the execution order for these tasks: TaskA depends on TaskB, TaskB depends on TaskC.

The valid execution order is TaskC, then TaskB, then TaskA.

Check if there is a cycle in this task list: A depends on B, B depends on A.

Yes, a circular dependency was detected: ["A", "B", "A"].

Find all isolated tasks in a graph where TaskA and TaskB are connected, but TaskC has no dependencies.

The isolated task is TaskC.

You can use the `resolve_execution_order` tool, which returns `parallelGroups` containing sets of task IDs that share the same depth level in the dependency graph.

Related Connectors