maPessimistic: Pessimistic game associated with minimum cost arborescences

In cooptrees: Cooperative aspects of optimal trees in weighted graphs

Description

Given a graph with at least one minimum cost arborescence, the maPessimistic function builds the pessimistic game.

Usage

maPessimistic(nodes, arcs)

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.

Value

maPessimistic returns a vector with the characteristic function of the pessimitic game.

Examples

# Graph
nodes <- 1:4
arcs <- matrix(c(1,2,7, 1,3,6, 1,4,4, 2,3,8, 2,4,6, 3,2,6,
                 3,4,5, 4,2,5, 4,3,7), ncol = 3, byrow = TRUE)
# Pessimistic game
maPessimistic(nodes, arcs)

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