Minimal directed spanning tree in Networkx

Question

Is there any implementation of minimal directed spanning trees (MDST) in networkx, one of the most famous algorithms to find MDSTs is Edmond's algorithm , but I don't find its implementation with networkx. Can any one help with that?

Note that this question is different from this qusetion , because in our case we want to find an MDST not an MST of the undirected version of the graph

Answer 1

networkx 有 Edmond 算法的实现： https ://networkx.github.io/documentation/stable/reference/algorithms/generated/networkx.algorithms.tree.branchings.Edmonds.html