Package: mcMST 1.1.1

mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

Algorithms to approximate the Pareto-front of multi-criteria minimum spanning tree problems.

Authors:Jakob Bossek [aut, cre]

mcMST_1.1.1.tar.gz
mcMST_1.1.1.zip(r-4.7)mcMST_1.1.1.zip(r-4.6)mcMST_1.1.1.zip(r-4.5)
mcMST_1.1.1.tgz(r-4.6-any)mcMST_1.1.1.tgz(r-4.5-any)
mcMST_1.1.1.tar.gz(r-4.7-any)mcMST_1.1.1.tar.gz(r-4.6-any)
mcMST_1.1.1.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
mcMST/json (API)

# Install 'mcMST' in R:

install.packages('mcMST', repos = c('https://jakobbossek.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/jakobbossek/mcmst/issues

On CRAN:

evolutionary-algorithms mcmst minimum-spanning-trees multi-objective-optimization spanningtrees

4.62 score 3 stars 28 scripts 162 downloads 33 exports 123 dependencies

Last updated from:4d5a18dfb7. Checks:9 OK. Indexed: yes.

Target	Result	Time
linux-devel-x86_64	OK	226
source / vignettes	OK	270
linux-release-x86_64	OK	233
macos-release-arm64	OK	148
macos-oldrel-arm64	OK	134
windows-devel	OK	130
windows-release	OK	116
windows-oldrel	OK	120
wasm-release	OK	182

Exports:charVecToEdgelist computeSimilarityMatrix edgeListToCharVec enumerateMST enumerateTSP genRandomMCGP genRandomSpanningTree genRandomSpanningTrees getCommonSubtrees getExactFront getExtremeSolutions getNumberOfCommonEdges getNumberOfSpanningTrees getRandomSpanningTree getSizeOfLargestCommonSubtree getWeight mcMSTEmoaBG mcMSTEmoaZhou mcMSTPrim mutEdgeExchange mutKEdgeExchange mutSubforestMST mutSubgraphMST mutUniformPruefer nodelistToEdgelist permutationToCharVec permutationToEdgelist plotEdgeFrequency plotEdges prueferToCharVec prueferToEdgeList sampleWeights scalarizeWeights

Dependencies:abind askpass backports base64enc BBmisc bslib cachem checkmate cli cluster colorspace corpcor cpp11 crosstalk curl data.table deldir digest dplyr ecr evaluate farver fastmap fastmatch fdrtool fontawesome foreign Formula fs generics ggplot2 glasso glue GPArotation grapherator gridExtra gtable gtools highr Hmisc htmlTable htmltools htmlwidgets httr igraph isoband jpeg jquerylib jsonlite kableExtra knitr labeling later lattice lavaan lazyeval lhs lifecycle magrittr MASS Matrix memoise mgcv mime misc3d mnormt nlme nnet numDeriv openssl otel parallelMap ParamHelpers pbapply pbivnorm permute pillar pkgconfig plot3D plot3Drgl plotly plyr png promises psych purrr qgraph quadprog R6 rappdirs RColorBrewer Rcpp RcppArmadillo reshape2 rgl rlang rmarkdown rpart rstudioapi S7 sass scales scatterplot3d smoof stringi stringr svglite sys systemfonts textshaping tibble tidyr tidyselect tinytex utf8 vctrs vegan viridis viridisLite withr xfun xml2 yaml

Brief introduction to mcMST

Quickstart | Generating a benchmark instance

Rendered fromintroduction.Rmdusingknitr::rmarkdown

Last update: 2017-12-06
Started: 2017-07-04

Citation

Development and contributors

Readme and manuals

Help Manual

Help page	Topics
mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem.	mcMST-package
Convert characteristic vector to edge list.	charVecToEdgelist
Compute similarity matrix.	computeSimilarityMatrix
Convert edge list to characteristic vector.	edgeListToCharVec
Enumerate all solution candidates.	enumerateMST enumerateTSP
Generate a bi-criteria graph with two uniformly randomly distribted edge weights.	genRandomMCGP
Generate a random spanning tree.	genRandomSpanningTree
Generate a set of random spanning trees.	genRandomSpanningTrees
Get common subtrees of two trees.	getCommonSubtrees
Enumerate all Pareto-optimal solutions.	getExactFront
Compute extreme spanning trees of bi-criteria graph problem.	getExtremeSolutions
Compute number of spanning trees of a graph	getNumberOfSpanningTrees
Generate random spanning tree.	getRandomSpanningTree
Get the overall costs/weight of a subgraph given its edgelist.	getWeight
Subgraph EMOA for the multi-criteria MST problem.	mcMSTEmoaBG
Pruefer-EMOA for the multi-objective MST problem.	mcMSTEmoaZhou
Multi-Objective Prim algorithm.	mcMSTPrim
One-edge-exchange mutator for edge list representation of spanning trees.	mutEdgeExchange
k-edge-exchange mutator for edge list representation of spanning trees.	mutKEdgeExchange
Forest-mutator for edge list representation.	mutSubforestMST
Subgraph-mutator for edge list representation.	mutSubgraphMST
Uniform mutation for Pruefer code representation.	mutUniformPruefer
Convert sequence of nodes to edge list.	nodelistToEdgelist
Convert permutation to characteristic vector.	permutationToCharVec
Convert permutation to edge list.	permutationToEdgelist
Visualization of edge frequency among solution set.	plotEdgeFrequency
Visualize edges common to several solutions.	plotEdges
Convert Pruefer code to characteristic vector.	prueferToCharVec
Convert Pruefer code to edge list.	prueferToEdgeList
Sample weights	sampleWeights
Scalarize weight matrizes.	scalarizeWeights
Metrics for spanning tree comparisson.	getNumberOfCommonEdges getSizeOfLargestCommonSubtree similarity_metrics