Given a directed graph,
getMinCostArcs selects the
minimum cost arcs entering each node and removes the
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.
getMinCostArcs function returns a matrix with
the list of the minimum cost arcs pointing to each node of
This function is an auxiliar function used in msArborEdmonds and getMinimumArborescence.