Earlier quoted context omitted.
Yeah, the UX/DX of the turning these algorithms into something usable is really interesting, and something I didn't get to talk much about. With the variations on the push algorithm, you do kind of need to know the graph topology ahead of time, at least to be able to traverse it efficiently and correctly (this is the topological sorting thing). But for pull (and therefore for push-pull), the dependencies can be compl…
do-notation -> dot-notation, right?
Do-notation in the sense of Haskell's monadic do blocks: https://en.wikibooks.org/wiki/Haskell/do_notation