Commit Graph

6 Commits

Author SHA1 Message Date
74d1f2be23 feat: Produce an O(n) to O(log2(n)) improvement in findPaths
Details: The findPathsInner function in lib/findPaths.js is too
expensive, and has a tendency to throw "too much recursion" errors.
However, it can be optimized. In particular, instead of just
going through all paths, we could go in the paths in the
right direction.

Note that: The current improvements don't do that yet. I was trying
to do that at the findDistance level, but I was being dumb.
2021-12-07 20:45:19 +01:00
fcc28c19aa feat: Added alert after comparisons are completed 2021-11-25 16:21:18 +00:00
51dbbc4b50 fix: uncompleted merge 2021-10-06 10:39:39 +02:00
cf17bf2f67 fix: attempt merge 2021-10-06 10:32:17 +02:00
946036077c fix: Miscellaneous improvements 2021-10-05 18:34:42 +02:00
8ffa27b738 Removed mongo integration 2021-09-23 00:17:53 +02:00