This package has implementation for Euclidean and Dijkstra algorithms. The function euclidean finds greatest common divisor for two numbers.Takes two numbers scalars or integers as arguments and return their greatest common divisor. The function dijkstra takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph. It takes data.frame and numeric scalar as arguments and returns vector.
Package details 


Author  Jasleen Kaur Mann and Aashana Nijhawan 
Maintainer  The package maintainer <[email protected]> 
License  Apache 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.