CODEWITHSUNDEEP
algorithmgraphminimum-spanning-tree
user3347255
user3347255

Reputation: 361

Finding a minimum spanning tree on a directed graph

What algorithm can I use to find a minimum spanning tree on a directed graph? I tried using a modification of Prim's algorithm, but wasn't able to make it work.

Upvotes: 36

Views: 34756

Answers (1)

templatetypedef
templatetypedef

Reputation: 373112

The equivalent of a minimum spanning tree in a directed graph is called an optimum branching or a minimum-cost arborescence. The classical algorithm for solving this problem is the Chu-Liu/Edmonds algorithm. There have been several optimized implementations of this algorithm over the years using better data structures; the best one that I know of uses a Fibonacci heap and runs in time O(m + n log n) and is due to Galil et al.

Hope this helps!

Upvotes: 44

Related Questions