mstEROKruskal: ERO rule for minimum cost spanning tree problems with Kruskal's algorithm
Description
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.
Usage
mstEROKruskal(nodes, arcs)
Arguments
nodes
vector containing the nodes of the graph,
identified by a number from $1$ until 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
mstEROKruskal returns a matrix with the agents and
their costs.