An Algorithm to Calculate Entire Routes between Communication Network Nodes based on Logic Algebra
Fusheng Dai · Shuxue de shijian yu renshi · 2006
For the Dijkstra and Bellman-Floyd route algorithm of computer network,the optimal route can be achieved according to given network parameters,but the entire practicable routes which are included in the network can not be obtained.In the other hand,in some aspects such as the theoretical research of communication network and network management,the entire available routes between nodes are required to be obtained.A new algorithm is studied in this paper,which can calculate all the routes from source node to arbitrary aim node of the network by applying the logic algebraic calculation rules,integrating and deleting rows of relative matrix and integrating and deleting n-1 times for a network with n nodes.The validity and rationality of the algorithm are demonstrated in detail,at the same time,the feasibility of parallel calculation and compatibility with the classical route algorithm are briefly introduced.The calculation course of the algorithm is shown by an example in detail and the correctness is validated.