yewei369/FancyPack.R.LiU.3: Euclidean+Dijkstra

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"

install.packages("remotes")
remotes::install_github("yewei369/FancyPack.R.LiU.3")