Algorithms to approximate the Pareto-front of multi-criteria minimum spanning tree problems. Additionally, a modular toolbox for the generation of multi-objective benchmark graph problems is included.
| Version: | 1.0.1 |
| Depends: | BBmisc (≥ 1.6), ecr (≥ 2.1.0) |
| Imports: | checkmate (≥ 1.1), parallelMap (≥ 1.3), reshape2 (≥ 1.4.1), gtools, vegan, ggplot2 (≥ 1.0.0), lhs |
| Suggests: | testthat (≥ 0.9.1), knitr, rmarkdown, gridExtra |
| Published: | 2017-09-18 |
| Author: | Jakob Bossek [aut, cre] |
| Maintainer: | Jakob Bossek <j.bossek at gmail.com> |
| BugReports: | https://github.com/jakobbossek/mcMST/issues |
| License: | BSD_2_clause + file LICENSE |
| URL: | https://github.com/jakobbossek/mcMST |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | mcMST results |
| Reference manual: | mcMST.pdf |
| Vignettes: |
Generating benchmark graphs Brief introduction to mcMST |
| Package source: | mcMST_1.0.1.tar.gz |
| Windows binaries: | r-devel: mcMST_1.0.1.zip, r-release: mcMST_1.0.1.zip, r-oldrel: mcMST_1.0.1.zip |
| macOS binaries: | r-release: mcMST_1.0.1.tgz, r-oldrel: mcMST_1.0.1.tgz |
| Old sources: | mcMST archive |
Please use the canonical form https://CRAN.R-project.org/package=mcMST to link to this page.