Hello. I have read your paper and the paper of HCNNG. I saw HCNNG is really competitive in performance but the author of it did not provide the source code. There is a repo (https://github.com/jalvarm/hcnng) which seems to be provided by the author but the implementation of the algorithm of HCNNG is different. For instance, the repo does not cover the initialization by KD-Tree and the guided search strategy.
So, could you please answer me how did you consider this problem and how do you implement HCNNG.
Thank you!
Hello. I have read your paper and the paper of HCNNG. I saw HCNNG is really competitive in performance but the author of it did not provide the source code. There is a repo (https://github.com/jalvarm/hcnng) which seems to be provided by the author but the implementation of the algorithm of HCNNG is different. For instance, the repo does not cover the initialization by KD-Tree and the guided search strategy.
So, could you please answer me how did you consider this problem and how do you implement HCNNG.
Thank you!