TheodorEmanuelsson/dijkstrasAlgorithm: Computes Euclidean and Dijkstra's algorithms in R
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).
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | |
| License | GPL (>= 3) |
| Version | 0.0.0.9000 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
