Description Details Author(s) References

Find the greatest common divisor between two numbers or find the shortest path in a graph.

Includes two algorithms (Euclidian and Dijkstra) and a dataset with three variables that contains the edges of the graph with the weight of the edge.

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

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

Barakat Bruno [aut, cre], De Biase Alessia [aut]

Maintainer: Bruno Barakat <barakatbruno@gmail.com>

Wikipedia (2017). *Eucliedean algorithm - Wikipedia, The Free Encyclopedia.*
https://en.wikipedia.org/wiki/Euclidean_algorithm , accessed 2017-09-14.

Wikipedia (2017). *Dijkstra's algorithm - Wikipedia, The Free Encyclopedia.*
https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm, accessed 2017-09-14.

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.