The current package holds implementation of Euclidean's sieve Algorithm and Dijkstra's Algorithm for finding the shortest path between two nodes.
devtools::install_github("shaiq681/alkhwarizm")
Please make sure that .Renvironment does not have GITHUB_PAT by default. Refer Issue
euclidean()
to find the Greatest Common Divisor between two Integers. dijkstra()
to find the shortest path between a single node and its neighbours.Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.