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 R package is a part of the coursework for the Advanced Programming in R course (732A94).