Commit Graph

10 Commits

Author SHA1 Message Date
f82043d24a tweak: Small convenience fixes 2021-12-08 11:20:03 +01:00
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
5f0cb26db0 fix: Too much recursion error + make sure mongo request goes through.
Too much recursion error: Use a simpler table
Make sure mongo request goes through:
- Do it before the computation +
- + put the computation inside a timeout.
2021-12-07 18:40:17 +01:00
2b9ce6e142 Change expected/max calculation when changing the dataset 2021-11-28 15:46:54 +00:00
56bab8f861 feat: Added expected and maximum number of comparisons 2021-11-28 15:33:19 +00:00
fcc28c19aa feat: Added alert after comparisons are completed 2021-11-25 16:21:18 +00:00
427bb9b231 tweak 2021-11-25 16:04:28 +00:00
ecd2476112 tweak: Additional UX improvements 2021-11-25 15:56:48 +00:00
b9a4a371fc fix: Aesthetics 2021-11-25 15:49:58 +00:00
7ae03e791b feat: Refactoring to make index.js and research.js use the same function 2021-11-25 15:31:10 +00:00