The R-SPPFP package implements different algorithms for transforming graphs in the Shortest Path Problem with Forbidden Paths (SPPFP). This problem is an important concept in the field of graph theories, and it is a variant of the traditional shortest path problem. In here, there is an additional constrait that takes the form of a finite set of forbidden paths (arc sequences of at least three nodes) that cannot be part of any solution path. Version 1.0.0.0 First stable release of advanced implementation of R-SPPFP! Includes the following functions: Transformation algorithms (Villeneuve & Desaulniers, and Hsu's et al.). Basic parsin functions: graph-to-digraph, and vpath translation. Integration functions: equivalent nodes selection, and igraph's integration.

{"references": ["D. Villeneuve and G. Desaulniers, \"The shortest path problem with forbidden paths,\" European Journal of Operational Research, vol. 165, no. 1, pp. 97-107, 2005, https://doi.org/10.1016/j.ejor.2004.01.032.", "C.-C. Hsu, D.-R. Chen, and H.-Y. Ding, \"An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths,\" in Inter-national Conference on Algorithms and Architectures for Parallel Processing, vol. LNCS 5574, Taipei, Taiwan, 2009, pp. 638-650, https://doi.org/10.1007/978-3-642-03095-6_60."]}