I feel I should thank to ymg for brilliant Dijikstra algorithm
Marko,
Hope everybody understand that the brilliance is with Dijkstra not with me.
What tou are achieving with your SHORTTINPATH function is actually a subset of the
Euclidian Minimum Spanning Tree.
The whole tree should encompass all the points.
For this there is Prim's algorithm, or even Djiktra's but Problem 1 from his 1959 paper.
You are right in the fact that the
EMST will always lie along the edges of a Delaunay triangulation.
ymg