networkx中minimum_spanning_arborescence背后的算法是什么？
[英]What is the algorithm behind minimum_spanning_arborescence in networkx?
问题描述
As far I know the usual algorithms used to evaluate the arborescence in directed graphs are initiated with a "beginning node". 
据我所知，用于评估有向图树状结构的常用算法是从“起点”开始的。 It is not clear for me the algorithm that is used. 我不清楚所使用的算法。 Can you help me? 你能帮助我吗？
0 个解决方案
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
加快networkx中的随机最小生成树？ - Speeding up random minimum spanning tree in networkx?
Networkx最小生成树-精度问题？ - Networkx Minimum Spanning Tree - precision issues?
Boruvka算法有向图的最小生成树 - Boruvka algorithm Minimum Spanning Tree for Directed Graphs
NetworkX最小生成树对于相同的数据有不同的集群排列？ - NetworkX Minimum Spanning Tree has different cluster arrangement with the same data?
使用 Prim 算法的最小生成树中的错误 - Bug in Minimum Spanning Tree using Prim's algorithm
这个算法背后的逻辑是什么？ - What is the logic behind this algorithm?
最小生成树问题 - Minimum Spanning Tree issue
Networkx 中的最小有向生成树 - Minimal directed spanning tree in Networkx
python 中的最小生成树 - Minimum spanning tree in python
生成带有networkx的有向图的树 - Spanning tree of directed graph with networkx
相关标签