It’s a lot easier to just have a depth limit on such non-cyclic graphs than keep...

		zemnmez on Nov 30, 2020 \| parent \| context \| favorite \| on: I Made a Self-Quoting Tweet It’s a lot easier to just have a depth limit on such non-cyclic graphs than keep an in-memory list of previously seen nodes. its interesting for sure! but a much rarer edge-case imo