Cooperation in minimum cost arborescence problems
Given a graph with at least one minimum cost arborescence,
maCooperative function computes the cooperative
and "Bird" and "ERO" rules.
maCooperative(nodes, arcs, show.data = TRUE)
- vector containing the nodes of the graph, identified by a number that goes from $1$ to the order of the graph.
- 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.
- logical value indicating if the function
displays the console output (
TRUE) or not (
FALSE). By default its value is
maCooperativereturns and prints a list with the cooperative games and allocation rules of a minimum cost arborescence problem.
# 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)
Looks like there are no examples yet.