The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.

mcMST 1.1.1

• fixed some warnings related to r-devel
• fixed issue in getRandomSpanningTree

mcMST 1.1.0

• added genRandomSpanningTree(s)
• graph generation moved to dedicated package grapherator
• mcMST EMOA algorithms now work on graphs with >= 3 weights per edge
• mcMST EMOA algorithms work on non-complete graphs
• added option scalarize to subGraph mutation
• added similarity metrics between trees: getNumberOfCommonEdges, getSizeOfLargestCommonSubtree
• added function getCommonSubtrees to get edgelists of all common subtrees of two trees
• added transformation function charVecToEdgelist
• added function computeSimilarityMatrix
• added getNumberOfSpanningTrees (based on Kirchhoff’s tree theorem)
• added visual methods to analyse solution sets: plotEdges, plotEdgeFrequency

mcMST 1.0.1

• improved documentation
• plotGraph replaced by S3 method plot.mcGP

mcMST 1.0.0

• first release to CRAN

These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.