Dependency Order Analyzer
Find a workable order for tasks that depend on each other. Check for loops that make the task order impossible.
How do I find a valid task order?
Represent each dependency as [prerequisite, dependent]. A topological sort finds a valid execution order when the directed graph contains no cycle. The report identifies a cycle when ordering is impossible.
Your result
A little clarity, right here.
Start with your own content or load the example. Your result will appear here.
Three simple steps
How to use Dependency Order Analyzer
Choose your input and review the processing notice.
Send the job to the isolated processing service.
Review the result and download your export.
Common questions
Good to know
Understand the result.
Keep the original.
Is this tool free, and are my files uploaded?
This tool is free with no account required. When you run the tool, your input goes to a separate processing service. Temporary files are deleted when the job ends. You can download the result to your device.
What are the limits and details?
A valid order respects dependencies but does not optimize staffing, deadlines, or resource capacity. Multiple valid orders can exist.
Limits: one file up to 8 MB; 500,000 characters per text field. One job runs at a time on the worker, with a two-minute limit.