euclidean: The Euclidean Algorithm
In abkw/lab03: lab3 package applies euclidean and dijkstra algorithms
Description
Usage
Arguments
Value
euclidean functions finds the greates common divisor of two integers and Dijkstra's shortest path algorithm in a graph
dijkstra function takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph.
See Also
Examples
Description
Euclidean Algorithm is an efficient method for computing the greatest common divisor (GCD) of two numbers, the largest number that divides both of them without leaving a remainder.
This package provides two categories of important functions:
euclidean and dijkstra.
Usage
1
euclidean(a, b)
Arguments
a
A Numerical value
b
A Numerical Value
Value
Gratest common divior of given values
euclidean functions finds the greates common divisor of two integers and Dijkstra's shortest path algorithm in a graph
NA
dijkstra function takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph.
NA
See Also
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1
2
abkw/lab03 documentation built on Oct. 31, 2019, 1:55 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value euclidean functions finds the greates common divisor of two integers and Dijkstra's shortest path algorithm in a graph dijkstra function takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph. See Also Examples
Description
Euclidean Algorithm is an efficient method for computing the greatest common divisor (GCD) of two numbers, the largest number that divides both of them without leaving a remainder.
This package provides two categories of important functions: euclidean and dijkstra.
Usage
1 | euclidean(a, b)
|
Arguments
a |
A Numerical value |
b |
A Numerical Value |
Value
Gratest common divior of given values
euclidean functions finds the greates common divisor of two integers and Dijkstra's shortest path algorithm in a graph
NA
dijkstra function takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph.
NA
See Also
https://en.wikipedia.org/wiki/Euclidean_algorithm
Examples
1 2 |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.