Comment

Comment by runnerup

I think there's a typo:

> It is in the shape of a Directed Acyclic Rooted Tree or simply a tree. The neat thing is, a tree-shaped computation is always "one-pass". Each node can only be passed at least once.

Should be:

> Each node can only be passed at most once.

parent runnerup 5 years ago

Discussion

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton