#' mcMST
#'
#' Pareto-front approximations for some graph problems obtained by several
#' algorithms for the multi-criteria minimum spanning tree (mcMST) problem.
#'
#' @format A data frame with four variables:
#' \describe{
#' \item{\code{f1}}{First objective (to be minimized).}
#' \item{\code{f2}}{Second objective (to be minimized).}
#' \item{\code{algorithm}}{Short name of algorithm used.}
#' \item{\code{prob}}{Short name of problem instance.}
#' \item{\code{repl}}{Algorithm run.}
#' }
#'
#' The data is based on the \pkg{mcMST} package.
#'
"mcMST"
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.