# mstPessimistic

0th

Percentile

##### Pessimistic game from a minimum cost spanning tree problem

Given a graph with at least one minimum cost spanning tree, the mstPessimistic function builds the pessimistic game.

##### Usage
mstPessimistic(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

mstPessimistic returns a vector with the characteristic function of the pessimistic game.

The more general function mstGames.

##### Aliases
• mstPessimistic
##### Examples
# 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)
# Pessimistic game
mstPessimistic(nodes, arcs)

Documentation reproduced from package cooptrees, version 1.0, License: GPL-3

### Community examples

Looks like there are no examples yet.