Networkx 中的最小有向生成树
[英]Minimal directed spanning tree in Networkx
问题描述
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. 
networkx 中是否有最小有向生成树 (MDST) 的任何实现，寻找 MDST 的最著名算法之一是Edmond's algorithm ，但我没有在 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请注意，这个问题是来自此不同qusetion ，因为在我们的例子中，我们要找到一个MDST不是MST的图的无向版本
1 个解决方案
解决方案1
1 已采纳 2020-02-13 14:55:18
networkx 有 Edmond 算法的实现： https ://networkx.github.io/documentation/stable/reference/algorithms/generated/networkx.algorithms.tree.branchings.Edmonds.html
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.