mstCooperative: Cooperation in minimum cost spanning tree problems

Description Usage Arguments Value Examples

View source: R/mstCooperative.R

Description

Given a graph with at least one minimum cost spanning tree, the mstCooperative function computes the pessimistic and optimistic games; and the most known allocation rules: "Bird", "Dutta-Kar","Kar" and "ERO".

Usage

1
mstCooperative(nodes, arcs, show.data = TRUE)

Arguments

nodes

vector containing the nodes of the graph, identified by a number that goes from 1 to the order of the graph.

arcs

matrix with the list of arcs of the graph. Each row represents one arc. The first two columns contain the two endpoints of each arc and the third column contains their weights.

show.data

logical value indicating if the function displays the console output (TRUE) or not (FALSE). By default its value is TRUE.

Value

mstCooperative returns and print a list with the cooperative games and the allocation rules of a minimum cost spanning tree problem.

Examples

1
2
3
4
5
6
# Graph
nodes <- 1:4
arcs <- matrix(c(1,2,6, 1,3,10, 1,4,6, 2,3,4, 2,4,6, 3,4,4),
               byrow = TRUE, ncol = 3)
# Cooperation in minimum cost spanning tree problems
mstCooperative(nodes, arcs)

cooptrees documentation built on May 30, 2017, 8:11 a.m.