rsppfp: R's Shortest Path Problem with Forbidden Subpaths

An implementation of functionalities to transform directed graphs that are bound to a set of known forbidden paths. There are several transformations, following the rules provided by Villeneuve and Desaulniers (2005) <doi:10.1016/j.ejor.2004.01.032>, and Hsu et al. (2009) <doi:10.1007/978-3-642-03095-6_60>. The resulting graph is generated in a data-frame format. See rsppfp website for more information, documentation an examples.

Version: 1.0.3
Depends: R (≥ 3.4.0)
Imports: dplyr, foreach, doParallel, igraph, tidyr, stringr
Suggests: knitr, rmarkdown, testthat, covr, ggplot2
Published: 2018-11-20
Author: Melina Vidoni ORCID iD [aut, cre], Aldo Vecchietti [aut]
Maintainer: Melina Vidoni <melinavidoni at santafe-conicet.gov.ar>
BugReports: https://github.com/melvidoni/rsppfp/issues
License: GPL-3
URL: https://github.com/melvidoni/rsppfp
NeedsCompilation: no
Materials: README NEWS
CRAN checks: rsppfp results

Downloads:

Reference manual: rsppfp.pdf
Vignettes: Transformations Benchmark
Example: Other Packages
rsppfp Description
Package source: rsppfp_1.0.3.tar.gz
Windows binaries: r-devel: rsppfp_1.0.3.zip, r-release: rsppfp_1.0.3.zip, r-oldrel: rsppfp_1.0.3.zip
OS X binaries: r-release: rsppfp_1.0.3.tgz, r-oldrel: rsppfp_1.0.3.tgz

Linking:

Please use the canonical form https://CRAN.R-project.org/package=rsppfp to link to this page.