henkar91/AdvRprogr_lab3: Euclidean and Dijkstra's algorithms
Version 1.0

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.

Getting started

Package details

AuthorMilda Poceviciute, Henrik Karlsson
MaintainerMilda Poceviciute <[email protected]>
LicenseGPL-2
Version1.0
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
install.packages("devtools")
library(devtools)
install_github("henkar91/AdvRprogr_lab3")
henkar91/AdvRprogr_lab3 documentation built on Oct. 1, 2017, 6:43 a.m.