{"date":"2026-10-14","from":{"k":"unit","s":"runner","n":"topologicalSort() > cycle fallback > prefers an action whose parent is visited over an earlier-registered action whose parent is not"},"to":{"k":"unit","s":"runner","n":"topologicalSort() > cycle break > which member it takes > prefers a member whose parent is visited over an earlier-registered member whose parent is not"}}
{"date":"2026-10-14","from":{"k":"unit","s":"runner","n":"topologicalSort() > cycle fallback > prefers the lowest remaining in-degree over registration order"},"to":{"k":"unit","s":"runner","n":"topologicalSort() > cycle break > which member it takes > prefers the lowest remaining in-degree over registration order"}}
{"date":"2026-10-14","from":{"k":"unit","s":"runner","n":"topologicalSort() > cycle fallback > breaks ties of parent state and in-degree by registration order"},"to":{"k":"unit","s":"runner","n":"topologicalSort() > cycle break > which member it takes > breaks ties of parent state and in-degree by registration order"}}
{"date":"2026-10-14","from":{"k":"unit","s":"runner","n":"topologicalSort() > cycle fallback > orders random cyclic work sets as the rule stated directly does"},"to":{"k":"unit","s":"runner","n":"topologicalSort() > cycle break > orders random cyclic work sets as the rule stated directly does"}}
{"date":"2026-10-14","from":{"k":"unit","s":"runner","n":"topologicalSort() > cycle fallback > reads each action's parent once while breaking thousands of cycles"},"to":{"k":"unit","s":"runner","n":"topologicalSort() > cycle break > reads each action's parent once while breaking thousands of cycles"}}
{"date":"2026-10-14","from":{"k":"unit","s":"runner","n":"topologicalSort() > cycle break > orders random cyclic work sets as the rule stated directly does"},"to":{"k":"unit","s":"runner","n":"topologicalSort() > cycle break > against the rule stated directly > orders work sets of one-way edges as the rule does"}}