2

I can use the Chu-Liu/Edmonds algorithm to get the minimum cost arborescence of a directed weighted graph. I want to apply this for a pre-specified subset of k vertices. (I know exactly which k vertices must be included in the the tree).

What are the steps required to apply the Chu-Liu/Edmonds algorithm?

Similar to Construct a minimum spanning tree covering a specific subset of the vertices, but for directed graphs / minimum cost arborescence (vs. undirected graphs / minimum spanning tree).

Community
  • 1
  • 1
user2398029
  • 6,699
  • 8
  • 48
  • 80
  • It is not clear to me what is exactly the question. If you are looking for hints for an actual implementation have a look here: http://www.gutenberg.us/articles/chu%E2%80%93liu/edmonds_algorithm#Algorithm – Diego Mazzaro Dec 21 '15 at 20:46
  • I have the implementation. The question is how to run it on a graph containing N vertices, where only a subset k of the vertices needs to be included in the graph. – user2398029 Dec 21 '15 at 22:09

0 Answers0