Learn R Programming

mcMST (version 1.1.1)

A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

Description

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

Copy Link

Version

Install

install.packages('mcMST')

Monthly Downloads

202

Version

1.1.1

License

BSD_2_clause + file LICENSE

Issues

13

Pull Requests

1

Stars

4

Forks

2

Maintainer

Jakob Bossek

Last Published

March 13th, 2023

Functions in mcMST (1.1.1)

getWeight

Get the overall costs/weight of a subgraph given its edgelist.
mutSubforestMST

Forest-mutator for edge list representation.
getNumberOfSpanningTrees

Compute number of spanning trees of a graph
mcMSTEmoaZhou

Pruefer-EMOA for the multi-objective MST problem.
getRandomSpanningTree

Generate random spanning tree.
mcMSTPrim

Multi-Objective Prim algorithm.
mutEdgeExchange

One-edge-exchange mutator for edge list representation of spanning trees.
mutKEdgeExchange

k-edge-exchange mutator for edge list representation of spanning trees.
mcMSTEmoaBG

Subgraph EMOA for the multi-criteria MST problem.
mcMST-package

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

Convert sequence of nodes to edge list.
plotEdges

Visualize edges common to several solutions.
prueferToCharVec

Convert Pruefer code to characteristic vector.
permutationToCharVec

Convert permutation to characteristic vector.
similarity_metrics

Metrics for spanning tree comparisson.
scalarizeWeights

Scalarize weight matrizes.
prueferToEdgeList

Convert Pruefer code to edge list.
sampleWeights

Sample weights
mutUniformPruefer

Uniform mutation for Pruefer code representation.
mutSubgraphMST

Subgraph-mutator for edge list representation.
plotEdgeFrequency

Visualization of edge frequency among solution set.
permutationToEdgelist

Convert permutation to edge list.
edgeListToCharVec

Convert edge list to characteristic vector.
enumerateTSP

Enumerate all solution candidates.
genRandomMCGP

Generate a bi-criteria graph with two uniformly randomly distribted edge weights.
computeSimilarityMatrix

Compute similarity matrix.
getExtremeSolutions

Compute extreme spanning trees of bi-criteria graph problem.
getCommonSubtrees

Get common subtrees of two trees.
genRandomSpanningTrees

Generate a set of random spanning trees.
genRandomSpanningTree

Generate a random spanning tree.
charVecToEdgelist

Convert characteristic vector to edge list.
getExactFront

Enumerate all Pareto-optimal solutions.