Algorithms to approximate the Pareto-front of multi-criteria minimum spanning tree problems.
| Version: | 1.1.1 |
| Depends: | BBmisc (≥ 1.6),ecr (≥ 2.1.0),grapherator |
| Imports: | checkmate (≥ 1.1),gtools,ggplot2 (≥ 1.0.0),vegan,qgraph,viridis,igraph |
| Suggests: | testthat (≥ 0.9.1),knitr,rmarkdown,gridExtra |
| Published: | 2023-03-13 |
| DOI: | 10.32614/CRAN.package.mcMST |
| Author: | Jakob Bossek [aut, cre] |
| Maintainer: | Jakob Bossek <j.bossek at gmail.com> |
| BugReports: | https://github.com/jakobbossek/mcMST/issues |
| License: | BSD_2_clause + fileLICENSE |
| URL: | https://github.com/jakobbossek/mcMST |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | mcMST results |