The n shortest remaining edges¹!

You don't wanna visit a node again you've already seen. So it's not 8th cause the previous ones aren't possible anymore.

- marks already excluded nodes

! marks target node

84860 [ 0 1 10 15 7 6 11 16 20 5 12 3 8 22 13 9 4 14 17 19 2 18 21 23 
+]

  [
  - [    0, 18], 
  - [ 3236,  2], 
  ! [ 3419, 23], 
  - [ 4874, 15], 
  - [ 5593, 19], 
  - [ 5954, 10], 
  - [ 6102,  7],
  * [ 6278, 21],
...
 [ 6883, 14], [ 8377,  6], [ 9100, 11], [ 9181, 17], [ 9367,  1], [103
+07,  4], [10709,  9], [12822,  0], [12955, 16], [15242, 20], [15400, 
+13], [15447, 22], [15982,  8], [16868,  3], [17301,  5], [17968, 12]
],
[download]

So it's effectively the shortest remaining possibility.

¹) successively take the shortest edge to a yet unvisited node