Description Usage Arguments Value See Also Examples

View source: R/mstEROKruskal.R

Given a graph with at least one minimum cost spanning tree,
the `mstEROKruskal`

function divides the cost of the
tree among the agents according to the ERO rule.

1 | ```
mstEROKruskal(nodes, arcs)
``` |

`nodes` |
vector containing the nodes of the graph,
identified by a number from |

`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. |

`mstEROKruskal`

returns a matrix with the agents and
their costs.

The more general function mstRules.

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)
# ERO with Kruskal
mstEROKruskal(nodes, arcs)
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.