Why Nostr? What is Njump?
2024-03-16 13:56:10

Greg Wilson on Nostr: npub1upkp7…4tcwy 1. Looking for cycles in graphs (more accurately, checking that ...

1. Looking for cycles in graphs (more accurately, checking that there *aren't* any) so that I know dependencies aren't circular. 2. The shunting yard algorithm (for hacking together a good-enough parser for legacy data formats). 3. Unification with wildcards to match one expression or tree against another (linting and comparing logical structure of HTML docs). 4. Don't know if Bloom filters count as an algorithm, but if so, that.
Author Public Key
npub1gu0vskzadshat7g3c75ygjkan9pvfw8rwdjak2suhp79uy7qm78saxg2n6