search

Wilfred / difftastic

a structural diff that understands syntax 🟥🟩
https://difftastic.wilfred.me.uk/
MIT License
20.92k stars 344 forks source link

Explore bidirectional Dijkstra #232

Open Wilfred opened 2 years ago

Wilfred commented 2 years ago

A meet in the middle algorithm might be significantly faster.

Wilfred commented 2 years ago

This might also enable running the two searches in parallel.

Cycatz commented 2 years ago

I am interested in this issue! Could you please elaborate where should the searching algorithm apply?