Yep, that's a fair description. Note that I'm not providing a merge algorithm, just a pretty way of viewing changes. I did look at modelling moves in an earlie

Yep, that's a fair description. Note that I'm not providing a merge algorithm, just a pretty way of viewing changes. I did look at modelling moves in an earlier prototype, but it's incredibly hard to display the result in a coherent way when there are also insertions. It was also easier to drop it when I moved to Dijkstra. As you can see in the screenshot in the readme, it does support inserting tree nodes whilst preserving children, which covers a ton of cases.