为了分析有向通信网络的中间节点的重要性,本文提出一种以节点表示端到端路由的快速寻找算法,该算法通过删除不同的中间节点后对端到端之间传输路由数量的影响,判断不同的中间节点对端到端通信网络的重要程度,某一中间节点的删除导致端到端路由数量越多,则表示该中间节点越重要.计算实例表明,该方法运算简单,具有一定的实用性. In order to analyze the importance of intermediate nodes in directional communication networks, this paper proposes a fast search algorithm for node-to-end routing. This algorithm reduces the number of end-to-end transmission routes by deleting different intermediate nodes, Judging the importance of different intermediate nodes to the end-to-end communication network, the deletion of an intermediate node leads to more end-to-end routes, which means that the more important this intermediate node is, the calculation example shows that the method is simple in operation and has certain Practicality.