Daniel Spiewak on Nostr: npub1c9m22…z9xjd It does! It's precisely this, in fact. The way it works is you ...

npub1c9m22hkc5h6zgrwkz48crhcpw6vch2rf6j97746ugl3neys86jeqyz9xjd (npub1c9m…9xjd) It does! It's precisely this, in fact. The way it works is you project a spanning tree over a subgraph and deliver that to the user, who edits it (returning a new tree), and then you reproject that back into the subgraph and splice into the whole. The corner cases involve arbitrary resolution, obviously, but they arise very rarely and are easy to steer around in practice when defining transformations.