Dijkstra's SSSP (Single source shortest path) algorithm:
gets the shortest path (geodesic distance) from source vertice(point) to all other vertices(points) defined by the edges of the adjasency matrix
DijkstraSSSP(Adj, Costs, source)[1:n,1:n] 0/1 adjascency matrix, e.g. from delaunay graph or gabriel graph
[1:n,1:n] matrix, distances between n points (normally euclidean)
int, vertice(point) from which to calculate the geodesic distance to all other points
ShortestPaths[1:n] vector, shortest paths (geodesic) to all other vertices including the source vertice itself
Preallocating space for DataStructures accordingly to the maximum possible number of vertices which is fixed set at the number 10001.
uses a changed code which is inspired by Shreyans Sheth 28.05.2015, see http://ideone.com/qkmt31