https://git.dkl9.net/dost/tree/8495c0a53c3cdcb622f1fecad899e751a2f7349c Recent commits to dost (8495c0a53c3cdcb622f1fecad899e751a2f7349c) 2025-07-10T04:12:28-04:00 tag:gitlist.org,2012:commit/8495c0a53c3cdcb622f1fecad899e751a2f7349c Trivially improve distance_hierarchy 2025-07-10T04:12:28-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/cf8eb64dbed0ed84cb41dbfc48ae3775f6fdf0d9 Frantically optimise cachey_nearest 2025-07-10T03:40:56-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/60a2e889e233eba1dca72fbab2cc16fda0a37e4b Cull to three good methods, now more efficient 2025-07-10T03:05:41-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/79b55474a5db26de967083e7ca3a723d74cadea8 String mode with Levenshtein distance 2025-07-07T00:48:17-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/fed0202573498bc9823d7ca0be080e23e843de5f Maximin method, analyse results harder 2025-07-06T01:56:15-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/329f839b85db6694147e8d0344fde878173645c8 Sample-spreading method, present better 2025-07-06T00:19:25-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/bbafe21351a773d576d81032d7eeac13c37b7c6d Greedy furthest-neighbour path, compare methods 2025-07-05T23:46:05-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/7c72f180c81d30a2cee8f5391e26f0ab925b5c21 Use a weird traversal of binary trees 2025-07-05T22:47:45-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/956f1282d59536da3415063d9aa3268f38b06144 Initial commit: greedy nearest-neighbour and total 2025-07-04T18:43:57-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt;