This package have two functions. The first is euclidean that is an algorithm that returns the greatest common divisor between a and b. The second function is the dijkstra algorithm that calculates the shortest distence from init node to all the other nodes.
Package details |
|
---|---|
Maintainer | Hearje Widing <harjewiding@gmail.com> |
License | MIT + file LICENSE |
Version | 0.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.