Introduce a customized A* algorithm.

This custom algo lazily compute the intersections between words, to avoid too much set operations and database reads
This commit is contained in:
Kerollmops
2020-06-14 12:51:54 +02:00
parent 69285b22d3
commit a8cda248b4
5 changed files with 262 additions and 65 deletions

View File

@ -28,7 +28,7 @@ structopt = { version = "0.3.14", default-features = false }
tempfile = "3.1.0"
# best proximity
pathfinding = "2.0.4"
indexmap = "1.4.0"
# to implement internally
itertools = "0.9.0"