In Lab 3, I made following packages:

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)


RajaHussnain/Lab3Package documentation built on Dec. 18, 2021, 9:51 a.m.