Tournament网络节点的排序算法

Sorting Algorithm of Tournament Network

在组合网络理论中,常将网络节点抽象为图的节点,借助图来研究网络的性质。本文将Tournament网络抽象为图,并以网络中节点输出的信息量为依据,重点探讨了双向连通Tournament网络节点的排序问题,并给出相应的算法。

In combination network theory,we often consider nodes of a network as vertexes of a graph,so we can study the properties of networks via graphs.In this article,we will specifically study Bi-connected tournament network,based on the amount of information each node transmit,and give an algorithm to sort all nodes according to their importance in this network.