Dependency order planner
Enter prerequisite edges to find independent execution layers or a dependency cycle.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
It reports an actual cycle such as a → b → a instead of presenting a completable order. Correct the cyclic edge and rerun.
design>build, build>test and design>copy form design → build/copy → test layers. Build and copy can start in the same layer.
A>B means A precedes B. At most 500 nodes; dates and task durations are not calculated.
Frequently asked questions
Is a partial order returned when a cycle exists?
It reports an actual cycle such as a → b → a instead of presenting a completable order. Correct the cyclic edge and rerun.
Are task durations or concurrency limits considered?
A>B means A precedes B. At most 500 nodes; dates and task durations are not calculated.
Calculation criteria and reference materials
- MIT OpenCourseWare — DFS and Topological Sort
A>B means A precedes B. At most 500 nodes; dates and task durations are not calculated.
Verification of calculation criteria: · Calculation·verification principles · Report errors