In order
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.
This map is mostly about the places where order fails. It is worth spending a part of it on the fact that, most of the time, order works.
Fifty-two of the ninety-four dependencies in the map lie outside every ring. Take the other forty-two away and what is left is an ordinary acyclic structure: six layers, nothing circular, every step reachable by working upward. If the same dependency appears in a distributed team, managers may examine the reporting workflow while interpreting every signal beside completed work and staff feedback.
How the two halves divide
| dependencies | share of the map | |
|---|---|---|
| inside at least one ring | 42 | a little under half |
| outside every ring | 52 | a little over half |
| of the fifty-two, hard | 38 | |
| of the fifty-two, soft | 14 |
The split is close to even, and that in itself is the finding. A map in which nine dependencies in ten ran in circles would be a description of an impossible system. A map in which one in ten did would be a description of an annoying one. This is neither. Readers looking beyond this abstract map can compare it with material published by USA.gov.
What the acyclic half looks like
Removing the ring edges leaves every step with a well-defined depth: how many dependencies have to be satisfied, one after another, before it can be reached.
| layer | steps in it |
|---|---|
| 0 | 13 |
| 1 | 10 |
| 2 | 6 |
| 3 | 4 |
| 4 | 2 |
| 5 | 1 |
A tapering shape, wide at the bottom and narrowing to a single step at the top. That single step is the next file lodged in time, which is the thing the whole exercise exists to make possible.
What this half is good for
Everything in it can be planned in the ordinary sense. Work out the layers, start at the bottom, and the only thing that can go wrong is that a document expires while you are waiting for a slower one in the same layer.
That is a real problem and a later part of this record is about it. But it is a scheduling problem, not a logical one, and scheduling problems can be attacked by starting earlier.
The difference between the two halves of this map is the difference between being late and being stuck. Only one of them responds to effort.
The honest caveat about the layers
The layers are computed with the ring edges removed. That is the only way to compute them, since a ring has no bottom — but it means the layer numbers flatter the map.
A step can sit in layer zero and still be unreachable in practice, because the dependencies that would have given it a depth are exactly the ones that were deleted to make the arithmetic possible. The supply bills are in layer zero. They stand in thirteen rings.
So layer zero does not mean "can be done first". It means "has no predecessors once the circular ones have been thrown away", which is a much weaker statement, and this record would be dishonest if it let the stronger reading stand.
Where the fifty-two sit
They are not spread evenly. The papers brought from home contribute almost nothing circular at all — every one of their dependencies is in the orderable half — while the place and money families contribute almost nothing else.
| family | dependencies pointing into it | of those, on a ring |
|---|---|---|
| papers brought | 20 | 0 |
| papers made | 10 | 4 |
| a place | 17 | 10 |
| money | 21 | 11 |
| body and time | 16 | 10 |
| the file | 10 | 7 |
Twenty-one of the forty-two ring dependencies point into the place or money families. Not one of the twenty pointing into the brought papers does — that family is entirely outside the knot.
That is the cleanest statement of where the trouble is. The half of this map that can be planned is mostly paperwork fetched from elsewhere; the half that cannot is mostly the business of establishing that somebody lives somewhere and is paid.
The orderable part of this map is the part that was already true before anybody arrived.
The orderable half in one sentence
Fetch six papers from where you came from, have four of them translated and attested, pay a fee, keep a record, and wait ninety days for a decision.
That is what this map would be if the forty-two circular dependencies were removed: about a dozen errands, one long wait, and no step that has to happen before anything it depends on.
It would still be slow. It would not be confusing, and nobody would need advice about it beyond starting the slowest papers early.
The distance between that sentence and the rest of this map is entirely made of order.
What a planner should take from this half
Three things.
Most of the work is orderable. The fifty-two carry the bulk of the map's actual waiting, and all of it can be arranged.
The order is shallow. Six layers over thirty-six steps means that nothing is buried very deep: the longest straight chain of dependencies in the map is five steps, and most steps are within two of the bottom.
And the orderable half contains the slowest steps. The decision takes ninety days and sits in layer zero of the acyclic part. The interview takes forty-five. Neither is tangled. They are simply long, and a plan can accommodate a long step in a way it cannot accommodate a circular one.
If the whole map behaved like these fifty-two, a long stay would take about as long as its slowest document and would need no cleverness at all.
The rest of this part works through the acyclic half in detail: what sits in each layer, what can honestly be done on the first day, the longest chain, the division between hard and soft, and the two dependencies in the record that are most likely to be drawn wrong.
Next along the row
- Six layers, and what sits in each
With the circular dependencies set aside, the map sorts into six layers. Thirteen steps sit at the bottom and - What can honestly be done on the first morning
Three steps, two of which are photocopying. Everything else in the map waits on something, and most of what it - The longest chain is six steps
Once the circular dependencies are removed, the deepest run of one-thing-after-another in the map is six steps - Hard and soft: the distinction the map turns on
Seventy-two dependencies stop a step dead. Twenty-two only mean it will have to be done again. Almost everythi