The package includes two functions: 1.Euclidean function for finding GCD of two integers;2.Dijkstra algorithm for finding shortest route, given a cost table of data frame and a numerical source point. Output is a vector of distance for all nodes acorrding to requirement, but it is possible to genereate the shortest route as well which is stored in first elements of list "nodes"
Package details 


Author  Jun Li 
Maintainer  Jun Li <junli559@student.liu.se> 
License  N/A 
Version  1.0 
Package repository  View on GitHub 
Installation 
Install the latest version of this package by entering the following in R:

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.