README.md
In yewei369/FancyPack.R.LiU.3: Euclidean+Dijkstra
FancyPack.R.LiU.3
Euclidean and Dijkstra functions
The package includes two functions:
Euclidean function for finding GCD of two integers;
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"
Pass status of Travis building:
https://travis-ci.org/yewei369/FancyPack.R.LiU.3.svg?branch=master
name<-"Jun Li"
liuid<-"junli559"
yewei369/FancyPack.R.LiU.3 documentation built on Nov. 5, 2019, 12:34 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
FancyPack.R.LiU.3
Euclidean and Dijkstra functions
The package includes two functions: Euclidean function for finding GCD of two integers; 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"
Pass status of Travis building: https://travis-ci.org/yewei369/FancyPack.R.LiU.3.svg?branch=master
name<-"Jun Li" liuid<-"junli559"
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
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.