mstOptimistic: Optimistic game of a minimum cost spanning tree problem
Description
Given a graph with at least one minimum cost spanning tree,
the mstOptimistic function builds the optimistic
game associated with it.
Usage
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.