I've factored out the Vector and Edge definitions in difftastic so I can experiment with different graph search algorithms! It's so much easier when you can toggle between them.
So far A* is only 10% faster than Dijkstra, but I've found an additional 20% win that benefits all :)
miniblog.
Related Posts
12
Spent a bunch of time learning about text diffing algorithms this evening.
"Myers Algorithm" refers to a specific paper written by Eugene Myers, and he published faster algorithms later!
One nice thing about quadratic algorithms: if you can reduce your N, you get a really nice speedup.
I've started seeing 'ort' merges in my git operations, which can apparently be hundreds of times faster than the previous merge algorithms: https://www.phoronix.com/scan.php?page=news_item&px=Git-2.33-Released