simal451/lab3mohal954simal451: Implements the Euclidian and Dijkstras algorithm.
Euclidian algorithm is used to the greatest common divisor of two numbers. Dijkstras algorithm is used to calculate the shortest path from an initial node to every other node in a graph.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Mohammed Ali, Simon Alsen |
| Maintainer | Mohammed Ali <mohal954@student.liu.se>, Simon Alsen <simal451@student.liu.se> |
| License | GPL-2 |
| Version | 1.0 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
