Commit Graph

12 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
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
a15965c9ba fix: Fixed annoying display bug 2021-11-26 14:31:30 +00:00
530589bbc0 tweak 2021-11-25 16:13:38 +00:00
e3832ad202 fix: minor improvements 2021-11-25 15:08:20 +00:00
b40727c9df tweaks: Id now alphabetical strings rather than numbers 2021-11-25 09:01:31 +00:00
3d380e4dfa Change slider to text field 2021-11-25 00:42:34 +00:00
f0525245de fix: Correct decimal places, rather than rounding to the nearest 0.01 2021-11-08 21:09:06 +00:00
9eeb35f998 fix: aesthetics 2021-10-06 17:10:05 +02:00
134e526f74 Fixed some bugs, added advanced options 2021-06-12 16:13:13 +02:00
4d6abd382b Improved the object structures I was using 2021-06-10 23:52:33 +02:00
9766165060 Changed slider order. Inferred relative utility compared to a reference point. However, object structures used in the code remain messy 2021-06-10 21:59:48 +02:00