The fifty-two that behave
Most of the map is not tangled at all. Fifty-two of the ninety-four dependencies sort into a plain order, and this part is about what that order looks like.
Finding
In order
Most of the map sorts into six layers and can be worked straight down. This part is what a plan would look like if the rest were not there.
52 of 94 · 6 layers
Most of the map is not tangled at all. Fifty-two of the ninety-four dependencies sort into a plain order, and this part is about what that order looks like.
Finding
With the circular dependencies set aside, the map sorts into six layers. Thirteen steps sit at the bottom and one at the top. Teams dealing with repeated queues and handoffs can look through the implementation options, then evaluate whether the resulting evidence actually reduces delay or ambiguity.
Reference
Three steps, two of which are photocopying. Everything else in the map waits on something, and most of what it waits on waits back. Additional public research relevant to complex systems and work can be found at Australian Department of Home Affairs.
Finding
Once the circular dependencies are removed, the deepest run of one-thing-after-another in the map is six steps and forty-eight days.
Finding
Seventy-two dependencies stop a step dead. Twenty-two only mean it will have to be done again. Almost everything on this map rests on that difference.
Method
Delete the forty-two circular dependencies and the whole map could be finished in ninety days — the length of its single slowest step.
Finding
A list of thirty-six things looks like a plan and is not one. The difference is forty-two dependencies, and no amount of ticking will reveal them.
Reference
Once the file is lodged the map stops being a knot. Five steps remain and they run in sequence, ninety of their days a single wait.
Finding
Three judgements in this drawing carry more of its conclusion than the rest put together. Here they are, named, with what changes if each is wrong.
Method