dimitramuni/euclidijk: Highest Common Factor And Finds Shortest Path

Euclidean algorithm finds highest common factor of two natural number and Dijkstra algorithm finds the shortest path for a given graph from a input node.

Getting started

Package details

AuthorDimitra Muni and Biswas Kumar
MaintainerDimitra Muni <dm472@student.liu.se>
LicenseMIT + file LICENSE
Version0.1.0
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
install.packages("remotes")
remotes::install_github("dimitramuni/euclidijk")
dimitramuni/euclidijk documentation built on Nov. 4, 2019, 10:31 a.m.