More and more about the algorithms. The package consists of two main fucntion, Euclidean to calculate the GCD of two numbers and the dijkstra's shortest path algorithm.
The DESCRIPTION file:
This package was not yet installed at build time.
Index: This package was not yet installed at build time.
~~ An overview of how to use the package, including the most important functions ~~
Maintainer: Ali Etminan <firstname.lastname@example.org>
~~ Literature or other references for background information ~~
~~ Optional links to other man pages, e.g. ~~
~~ simple examples of the most important functions ~~
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.