In this paper, we study the properties of the spanning arborescence in a network, and propose a simple algorithm for finding the minimum arborescence in a network, we also discuss the complexity of this algorithm and present an example for applying this algorithm.

  • 研究网络中支撑树形图的性质,提出了在网络图中寻找最小树形图的简易算法,并对算法的复杂性进行了讨论,还给出应用该算法进行计算的一个实际算例。

  • 互联网摘选 2025-01-19 23:25:55

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句