I ran into this code.
|
currObj = top_candidates.top().second; |
The
top_candidates is a max heap, and we start searching on each layer with the farest neighbor of candidates on last layer.
Should we start with the nearest neighbor instead? Or did I miss anything? Thanks!