mstOptimistic: Optimistic game of a minimum cost spanning tree problem

Description Usage Arguments Value See Also Examples

View source: R/mstOptimistic.R

Description

Given a graph with at least one minimum cost spanning tree, the mstOptimistic function builds the optimistic game associated with it.

Usage

1
mstOptimistic(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

mstOptimistic returns a vector with the characteristic function of the optimistic game.

See Also

The more general function mstGames.

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)
# Optimistic game
mstOptimistic(nodes, arcs)

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