martynas2514/Lab03: Euclidean and Dijkstra algorithms
Euclidian algorithm: finds the greatest common divisor of two numbers Djikstra algorithm: calculates the shortest path from the initial node to every other node in the graph.
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | Martynas Lukosevicius <martynas2514@gmail.com> |
| License | GPL-2 |
| Version | 0.01 |
| URL | https://github.com/martynas2514/Lab03 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
