EuclideanDijkstra: Euclidean and Dijkstra's algorithms

In henkar91/AdvRprogr_lab3: Euclidean and Dijkstra's algorithms

Description

Euclidean algorithm is an efficient way of finding the greatest common divisor for two numbers. The function in this package is based on the pseudocode provided in the wikipedia page of Euclidean Algorithm. Dijkstra's algorithm is used for for finding the shortest paths between vertices in a given graph. The function in this package is also based on the pseudocode provided in Wikipedia page of Dijkstra's algorithm.

Details

The DESCRIPTION file: This package was not yet installed at build time.

Index: This package was not yet installed at build time.

Author(s)

Milda Poceviciute, Henrik Karlsson

Maintainer: Milda Poceviciute <[e-mail]>

References

https://en.wikipedia.org/wiki/Euclidean_algorithm https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

See Also

https://github.com/henkar91/AdvRprogr_lab3

Examples

euclidean(1000, 10)
dijkstra(wiki_graph, 1)

henkar91/AdvRprogr_lab3 documentation built on May 17, 2019, 12:11 p.m.