How to I calculate the minimum spanning arborescence efficiently for a dense graph?

Question

I want to calculate the minimum spanning arborescence for many dense graphs with around 200 nodes; However, this proves to be very slow with networkx;

Networkx has a bui