Description Usage Arguments Details Value Note Author(s) References

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

1 | ```
DijkstraSSSP(Adj, Costs, source)
``` |

`Adj` |
[1:n,1:n] 0/1 adjascency matrix, e.g. from delaunay graph or gabriel graph |

`Costs` |
[1:n,1:n] matrix, distances between n points (normally euclidean) |

`source` |
int, vertice(point) from which to calculate the geodesic distance to all other points |

Preallocating space for DataStructures accordingly to the maximum possible number of vertices which is fixed set at the number 10001.

ShortestPaths[1:n] vector, shortest paths (geodesic) to all other vertices including the source vertice itself

runs in O(E*Log(V))

Michael Thrun

uses a changed code which is inspired by Shreyans Sheth 28.05.2015, see http://ideone.com/qkmt31

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.