RecallWeave · Dependency planWorks offline

Follow the arrows. Build a valid plan.

Which job can finish next, and what is holding the others back? Try a small graph, choose the ready jobs, and see how one decision changes the rest.

X → Y means X must complete before Y.

1 · Set up the graph

Names and prerequisites

Enter 1–8 unique names, one per line, with 1–32 Unicode characters per name. Names are case-sensitive. Keep arrows out of names.

One arrow per line: A -> B or A → B. Use exact names from above. Blank means no dependencies. List each arrow once; a self-loop is allowed.

Blank lines and outer spaces are ignored. Tabs and control characters are refused. The full draft is limited to 8 KiB of UTF-8 text. Editing clears the active plan and its progress.

Try a course example

An example replaces both inputs and starts a fresh preview. Your work stays in this tab until you close or reload it.

Try it, then explain why

  1. In Shared prerequisites, finish B before A. Why is C still waiting?
  2. In Cycle and downstream, finish D and E. Why does C remain blocked even though it is not a cycle member?
  3. Remove the arrow B → A, then preview that edited graph. Which jobs are ready now?
Check your reasoning

C needs both A and B. In the cycle example, A and B each wait for the other; C depends on B without providing a return path. Removing B → A leaves A and D ready at the start, so a complete order becomes possible.

Keep learning with the original course

Twelve questions connect arrows, reachability, valid orders and cycles. This button downloads the original course unchanged, including its answers and attribution.

Open the learner in another tab, choose the downloaded JSON file, inspect its preview, then select Start this deck. The learner link uses the repository folder layout. The explorer and course download work as a single offline file.

Read the full course guide and original source references.