Workflow Circular Dependency Detection and Code Reasoning Dataset
- Records
- 8055
- Size
- 0.5GB
- Format
- JSON
- Provider
MOBIUSI INC- Updated
- v1.02026-11-04
This dataset contains workflow source code examples with task dependency registration, validation, topological sorting, and cycle detection logic. It covers invalid cycles, implicit back edges, and incorrect dependency registrations, with annotations for the original dependency graph, topological order, cycle evidence, unschedulable reasons, corrected graphs, and repair explanations. It supports training and evaluation of models that reason about graph constraints and dependency validity in workflow engines, job orchestration platforms, and related code analysis tasks.
Overview
Dataset Insights
Preview
Sample Examples
Schema
Technical Specifications
| Field | Type | Description |
|---|---|---|
| file_name | string | File name |
| has_cycle | boolean | Indicates whether a directed cycle was detected in the original dependency graph. |
| source_code | string | A workflow source code example containing task dependency registration, dependency validation, topological sorting, or cycle detection logic. |
| cycle_evidence | array | Identifies the tasks and dependency edges involved in the cycle, along with relevant source code locations. |
| dependency_graph | object | The original task dependency graph inferred from the tasks and dependency registration logic in the source code. |
| topological_order | array | The task order produced by topological sorting of the dependency graph. If a cycle exists, it usually contains only the nodes whose in-degrees can be eliminated. |
| repair_explanation | string | Describes which dependencies should be removed, modified, or registered again, and why the repaired graph satisfies directed acyclic graph and scheduling constraints. |
| unschedulable_reason | string | Explains how circular dependencies prevent a valid execution order and why topological sorting cannot be completed. |
| corrected_dependency_graph | object | A valid task dependency graph inferred after removing invalid cycles, erroneous dependencies, or unnecessary back edges. |
Trust
Compliance Statement
Authorization Type
Proprietary - Commercial AI Training License (No Redistribution)
Commercial Use
Requires exclusive subscription or authorization contract (monthly or per-invocation charging)
Privacy and Anonymization
No PII, no real company names, simulated scenarios follow industry standards
Compliance System
Compliant with China's Data Security Law / EU GDPR / supports enterprise data access logs
FAQ
Frequently Asked Questions
- What does the dataset contain?
- It includes source code examples involving workflow dependency registration, validation, topological sorting, or cycle detection, along with annotations such as the original dependency graph, cycle evidence, unschedulable reasons, corrected graphs, and repair explanations.
- How are topological orders represented when a cycle exists?
- When the dependency graph contains a cycle, the topological order typically includes only the nodes whose in-degrees can be eliminated. Dedicated fields describe whether a cycle exists, the involved tasks and dependency edges, and why sorting could not be completed.
- How can I obtain the dataset, and what are the licensing terms?
- Check the dataset product or delivery page for available download and delivery options. The applicable license, commercial-use permissions, and redistribution restrictions are defined by the dataset license and product-page terms.
- Which training and evaluation scenarios does it support?
- It supports code SFT, code reasoning evaluation, workflow dependency validation, and scheduling failure analysis. Models can be trained to find invalid cycles, explain why tasks cannot be scheduled, and propose dependency repairs that satisfy directed acyclic graph constraints.
Can't find the data you need?
Post a request and let data providers reach out to you.
Get this Dataset
High-quality data, ready for your next AI breakthrough.
Cite this Work
@dataset{Mobiusi2026,
title={Workflow Circular Dependency Detection and Code Reasoning Dataset},
author={MOBIUSI INC},
year={2026},
url={https://www.mobiusi.com/datasets/91df7fd1d6778710053675713b560a05?dataset_scene_id=19},
urldate={2026-10-28},
keywords={workflow cycle detection,task scheduling code,dependency graph reasoning,directed cycle detection,topological sorting,code reasoning dataset,scheduling systems,dependency repair},
version={1.0}
}Using this in research? Please cite us.