Skip to content

Implementations of the Euclidean algorithm, which calculates the greatest common divisor of two integers, and Dijkstra's algorithm, used for finding the shortest path in a graph.

Notifications You must be signed in to change notification settings

aurora-mm/TwoFamousAlgorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

R-CMD-check

Overview

This R package features implementations of the Euclidean algorithm, which calculates the greatest common divisor of two integers, and Dijkstra's algorithm, used for finding the shortest path in a graph. This package is a part of the coursework for the Advanced Programming in R course (732A94) at Linköping University.

Installation

To install this R package, first install devtools with install.packages("devtools"). Then, run devtools::install_github("aurora-mm/TwoFamousAlgorithms") to install the package from GitHub.

Authors

Linn Friberg, John Möller

About

Implementations of the Euclidean algorithm, which calculates the greatest common divisor of two integers, and Dijkstra's algorithm, used for finding the shortest path in a graph.

Topics

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages