11 Commits

Author	SHA1	Message	Date
NunoSempere	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
NunoSempere	e3832ad202	fix: minor improvements	2021-11-25 15:08:20 +00:00
NunoSempere	b40727c9df	tweaks: Id now alphabetical strings rather than numbers	2021-11-25 09:01:31 +00:00
NunoSempere	3d380e4dfa	Change slider to text field	2021-11-25 00:42:34 +00:00
NunoSempere	7d47a76d21	fix: graph display	2021-10-06 16:05:11 +02:00
NunoSempere	134e526f74	Fixed some bugs, added advanced options	2021-06-12 16:13:13 +02:00
NunoSempere	5f03f187c6	Fixed bug in graph implementation	2021-06-11 09:05:23 +02:00
NunoSempere	4d6abd382b	Improved the object structures I was using	2021-06-10 23:52:33 +02:00
NunoSempere	9c0f1e80a6	Better display results at the end	2021-06-07 16:37:41 +02:00
NunoSempere	3f5a9fbe04	Add post shell	2021-06-07 13:16:28 +02:00
NunoSempere	3102265aa8	Added a graph which shows the comparison relationships	2021-06-07 10:57:38 +02:00