diff options
| author | Lia Lenckowski <lialenck@protonmail.com> | 2024-11-27 16:52:29 +0100 |
|---|---|---|
| committer | Lia Lenckowski <lialenck@protonmail.com> | 2024-11-27 16:52:29 +0100 |
| commit | 71ba8b2c3e97cf7387f6021cb440e2845e86f303 (patch) | |
| tree | 160942c668aa45cf562c91458e2527a03933ad2f | |
| parent | 528964f2241f715812798a20f204c330cb527d02 (diff) | |
| download | embeddings-sort-71ba8b2c3e97cf7387f6021cb440e2845e86f303.tar embeddings-sort-71ba8b2c3e97cf7387f6021cb440e2845e86f303.tar.bz2 embeddings-sort-71ba8b2c3e97cf7387f6021cb440e2845e86f303.tar.zst | |
docu fix
| -rw-r--r-- | README.md | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -28,9 +28,9 @@ Options: ``` ## Insides -The chrisofides implementation uses an approximated min-weight matching algorithm, which may be non-ideal, though I haven't benchmarked how much of a difference it makes (mainly due to the implementation complexity of an exact algorithm, which would also increase the implementations complexity from O(n²) to O(n³) where n is the number of given images). +The christofides implementation uses an approximated min-weight matching algorithm, which may be non-ideal, though I haven't benchmarked how much of a difference it makes (mainly due to the implementation complexity of an exact algorithm, which would also increase the implementations complexity from O(n²) to O(n³) where n is the number of given images). -The 2-Opt refinement algorithm uses a doubly linked list with implicit iteration order to be able to do 2-Opt swaps in O(n), bringing a 2-Opt iteration to O(n²) complexity. +The 2-Opt refinement algorithm uses a doubly linked list with implicit iteration order to be able to do 2-Opt swaps in O(1), bringing a 2-Opt iteration to O(n²) complexity. ## Compatibility `embeddings-sort` has, at some point, worked on both linux and windows. |