Learn R Programming
⚠️There's a newer version (1.1.1) of this package.Take me there.

mcMST (version 1.0.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. Additionally, a modular toolbox for the generation of multi-objective benchmark graph problems is included.

Copy Link

Version

Install

install.packages('mcMST')

Monthly Downloads

202

Version

1.0.1

License

BSD_2_clause + file LICENSE

Issues

13

Pull Requests

1

Stars

4

Forks

2

Maintainer

Jakob Bossek

Last Published

September 18th, 2017

Functions in mcMST (1.0.1)

permutationToEdgelist

Convert permutation to edge list.
permutationToCharVec

Convert permutation to characteristic vector.
mutEdgeExchange

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

Pruefer-EMOA for the multi-objective MST problem.
plot.mcGP

Visualize bi-objective graph.
mcMST-package

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

Uniform mutation for Pruefer code representation.
mutSubgraphMST

Subgraph-mutator for edge list representation.
mcMSTPrim

Multi-Objective Prim algorithm.
mcMSTEmoaBG

Subgraph EMOA for the multi-criteria MST problem.
prueferToEdgeList

Convert Pruefer code to edge list.
prueferToCharVec

Convert Pruefer code to characteristic vector.
coordGenerators

Coordinate generators.
addCoordinates

Add node coordinates to graph.
addCenters

Add cluster centers to graph.
getExactFront

Enumerate all Pareto-optimal solutions.
genRandomMCGP

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

Add weights to a multi-objective graph.
edgeListToCharVec

Convert edge list to characteristic vector.
mcGP

Generate a bare multi-objective graph.
enumerateTSP

Enumerate all solution candidates.
getWeight

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