maCooperative: Cooperation in minimum cost arborescence problems

In cooptrees: Cooperative aspects of optimal trees in weighted graphs

Description

Given a graph with at least one minimum cost arborescence, the maCooperative function computes the cooperative and "Bird" and "ERO" rules.

Usage

maCooperative(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

maCooperative returns and prints a list with the cooperative games and allocation rules of a minimum cost arborescence problem.

Examples

# Graph
nodes <- 1:4
arcs <- matrix(c(1,2,2, 1,3,3, 1,4,4, 2,3,3, 2,4,4, 3,2,3,
                 3,4,1, 4,2,1, 4,3,2), ncol = 3, byrow = TRUE)
# Cooperation in minimum cost arborescence problems
maCooperative(nodes, arcs)

cooptrees documentation built on May 2, 2019, 3:59 p.m.