R/rlab03.R

In nahfa911/rlab03: Greatest common divisor of two numbers and the shortest path in a graph

#' rlab03 package
#'
#' This package has two functions \code{\link{euclidean}} and
#' \code{\link{dijkstra}}.The first function can be used to find the greatest
#' common divisor of two numbers and the second one takes a graph and an initial
#' node and calculates the shortest path from the initial node to every other
#' node in the graph.
#'
#' @docType package
#'
#' @name rlab03
#'
NULL