Given a graph with at least one minimum cost spanning tree,
mstCooperative function computes the pessimistic
and optimistic games; and the most known allocation rules:
"Bird", "Dutta-Kar","Kar" and "ERO".
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 (
mstCooperative returns and print a list with the
cooperative games and the allocation rules of a minimum
cost spanning tree problem.
1 2 3 4 5 6
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.