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
..
comparisonView.js	feat: Produce an O(n) to O(log2(n)) improvement in findPaths	2021-12-07 20:45:19 +01:00
d3experiment.js	Added a graph which shows the comparison relationships	2021-06-07 10:57:38 +02:00
displayAsMarkdown.js	Fixed some bugs, added advanced options	2021-06-12 16:13:13 +02:00
displayElement.js	chore: Update links to more information about GW moral goods	2021-10-06 12:18:23 +02:00
findPaths.js	feat: Produce an O(n) to O(log2(n)) improvement in findPaths	2021-12-07 20:45:19 +01:00
labeledgraph.js	feat: Produce an O(n) to O(log2(n)) improvement in findPaths	2021-12-07 20:45:19 +01:00
pushToMongo.js	feat: Produce an O(n) to O(log2(n)) improvement in findPaths	2021-12-07 20:45:19 +01:00
slider.js	feat: Added reasoning field	2021-11-25 11:58:50 +00:00
textAreaForJson.js	Fixed some bugs, added advanced options	2021-06-12 16:13:13 +02:00
utils.js	feat: Added expected and maximum number of comparisons	2021-11-28 15:33:19 +00:00