jasleen8713/RPackages_Lab3: R implementation of Euclidean and Dijkstra algorithms

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.

Getting started

Package details

AuthorJasleen Kaur Mann and Aashana Nijhawan
MaintainerThe package maintainer <[email protected]>
LicenseApache License
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
jasleen8713/RPackages_Lab3 documentation built on Sept. 21, 2018, 10:27 p.m.