R/nicolasyuki.R

#' nicolasyuki: A package that helps you calculate the Greatest Common Divisior (GCD) of two integer numbers 
#' and the shortest path between two nodes in a graph.
#'
#' The foo package provides two categories of important functions:
#' euclidean, dijkstra
#' 
#' @section nicolasyuki functions:
#' euclidean
#' dijkstra
#'
#' @docType package
#' @name nicolasyuki
senseiyukisan/732A94 documentation built on Sept. 18, 2020, 12:56 p.m.