dijkstrasAlgorithm-package: Euclidean and Dijkstra's algorithm as an R package.
In TheodorEmanuelsson/dijkstrasAlgorithm: Computes Euclidean and Dijkstra's algorithms in R
Description
An R package for solving the Euclidean and Dijkstra algorithms. It includes a function for computing the greatest common divisor between two scalars (Euclidean algorithm) and a function for computing the shortest paths between nodes in a graph (Dijkstra's algorithm).
Author(s)
Maintainer: Theodor Emanuelsson theodor.emanuelsson@me.com
TheodorEmanuelsson/dijkstrasAlgorithm documentation built on Dec. 18, 2021, 4:11 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.
Description
An R package for solving the Euclidean and Dijkstra algorithms. It includes a function for computing the greatest common divisor between two scalars (Euclidean algorithm) and a function for computing the shortest paths between nodes in a graph (Dijkstra's algorithm).
Author(s)
Maintainer: Theodor Emanuelsson theodor.emanuelsson@me.com
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.