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.4
Depends: R (≥ 3.4.0)
Imports: dplyr, foreach, doParallel, igraph, tidyr, stringr
Suggests: knitr, rmarkdown, testthat, covr, ggplot2
Published: 2019-02-19
DOI: 10.32614/CRAN.package.rsppfp
Author: Melina Vidoni ORCID iD [aut, cre], Aldo Vecchietti [aut]
Maintainer: Melina Vidoni <melinavidoni at>
License: GPL-3
NeedsCompilation: no
Materials: README NEWS
CRAN checks: rsppfp results


Reference manual: rsppfp.pdf
Vignettes: Transformations Benchmark
Example: Other Packages
rsppfp Description


Package source: rsppfp_1.0.4.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): rsppfp_1.0.4.tgz, r-oldrel (arm64): rsppfp_1.0.4.tgz, r-release (x86_64): rsppfp_1.0.4.tgz, r-oldrel (x86_64): rsppfp_1.0.4.tgz
Old sources: rsppfp archive


Please use the canonical form to link to this page.