Daniel Spiewak on Nostr: npub1c9m22…z9xjd This reminds me of an observation my team and I made several years ...

npub1c9m22hkc5h6zgrwkz48crhcpw6vch2rf6j97746ugl3neys86jeqyz9xjd (npub1c9m…9xjd) This reminds me of an observation my team and I made several years ago, which is that the most practically useful class of graphs are DAGs, and the most useful class of transformation is one which can be expressed as a spanning tree projected onto a DAG. This observation opens up a lot of flexibility from a representation standpoint, since most functional languages tend to be great at dealing with trees, so mapping to and from spanning trees keeping the DAG canonical is really nice.