Off-by-one error in the book examples about differential-dataflow HOT 4 CLOSED

I'm not sure I see the bug. The self-loop is intentional, if that is what you mean.

from differential-dataflow.

Shouldn't the input edges be:

(0, 1)
(0, 2)
(1, 3)
(1, 4)
...

such that 0 is the skip-level manager of 3 and 4 ?

from differential-dataflow.

Erm, not in this example? Is the problem that (0,0) seems like a weird management relation? It exists for a reason (so that we don't drop records without two hops), but if you would prefer there to be a different tree that should work too.

from differential-dataflow.

Ah, I got the idea now, its not an error, its just a "weird" tree :) I found the example a little confusing because I was expecting a tree like the one on the left side here, but the actual tree in use is the one on the right side (correct me if I'm wrong). That one makes the example a little difficult to understand because now 0 and 1 actually have a skip-level relationship although they are direct neighbors.

from differential-dataflow.