shashiniyer/Euclid_Dijkstras: Implements Euclid's and Djikstra's Algorithms
There are two functions in the package: one implements Euclid's algorithm to find the greatest common divisor of two numbers, and the other implements Dijkstra's algorithm to compute the shortest distance/path from one node to another in a connected graph
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Rojan and Shashi |
| Maintainer | <shashiniyer@gmail.com>, <rojankarakaya@gmail.com> |
| License | GPL-3 |
| Version | 1.0 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
