R/euclid.djikstras.R

#' euclid.dijkstras
#' 
#' A package for two functions: one to compute the greatest common divisor of two numbers using Euclid's algorithm, another to compute the shortest distance between vertices in a graph using Dijkstra's algorithm
#'
#' The two functions in the package are:
#' \strong{euclidean} and \strong{dijkstra}
#' 
#' @section More details available here:
#' \code{\link{euclidean}}
#' \code{\link{dijkstra}}
#'
#' @docType package
#' @name euclid.dijkstras
NULL
shashiniyer/Euclid_Dijkstras documentation built on Dec. 23, 2021, 1:21 a.m.