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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.4 |
rolling linux/jammy R-4.5 | rsppfp_1.0.4.tar.gz |
156.0 KiB |
1.0.4 |
rolling linux/noble R-4.5 | rsppfp_1.0.4.tar.gz |
156.0 KiB |
1.0.4 |
rolling source/ R- | rsppfp_1.0.4.tar.gz |
145.2 KiB |
1.0.4 |
latest linux/jammy R-4.5 | rsppfp_1.0.4.tar.gz |
156.0 KiB |
1.0.4 |
latest linux/noble R-4.5 | rsppfp_1.0.4.tar.gz |
156.0 KiB |
1.0.4 |
latest source/ R- | rsppfp_1.0.4.tar.gz |
145.2 KiB |
1.0.4 |
2026-04-26 source/ R- | rsppfp_1.0.4.tar.gz |
145.2 KiB |
1.0.4 |
2026-04-23 source/ R- | rsppfp_1.0.4.tar.gz |
145.2 KiB |
1.0.4 |
2026-04-09 windows/windows R-4.5 | rsppfp_1.0.4.zip |
164.1 KiB |
1.0.4 |
2025-04-20 source/ R- | rsppfp_1.0.4.tar.gz |
145.2 KiB |