#' 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
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.