Euclidean algorithm is an efficient way of finding the greatest common divisor for two numbers. The function in this package is based on the pseudocode provided in the wikipedia page of Euclidean Algorithm. Dijkstra's algorithm is used for for finding the shortest paths between vertices in a given graph. The function in this package is also based on the pseudocode provided in Wikipedia page of Dijkstra's algorithm.
Package details 


Author  Milda Poceviciute, Henrik Karlsson 
Maintainer  Milda Poceviciute <[email protected]> 
License  GPL2 
Version  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.