R/myPackage.R

luid<- "samza595 and rabsh696"
name<- "saman zahid & rabnawaz jansher"

#' Rcourse Lab 3 myPackage.
#' Package contains implementations of Dijkstra and Euclidean algorithm.
#' dijkstra find shortest path from the initial node in the given grapg
#' euclidean calculate the greatest common divisior of two numbers.
#' Package contains implemetation of two algorithm. i.e (euclidean & dijkstra.)
#' @section euclidean functions:
#'
#' Euclidean() returns scaler numeric greatest common divisor greatest common divisor
#' @section dijkstra functions:
#' dijkstra() returns vector of the shortest path from initial node to all other node in graph.
#' @seealso \link[myPackage]{euclidean}
#' @seealso \link[myPackage]{dijkstra}
#' @seealso \link[myPackage]{wiki_graph}
#' @docType package
#' @name myPackage
#'
NULL
rjkhan/RCourse-lab3 documentation built on May 31, 2019, 8:56 a.m.