1: Euclidean Algorithm (To calculate G.C.D)
2: Dijkstra Algorithm (To find shartest path in a graph)
library(Lab3Package) euclidean(123612, 13892347912) euclidean(100, 1000) dijkstra(wiki_graph, 1) dijkstra(wiki_graph, 3)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.