Abstract
The article proposes a fast algorithm for constructing the transitive closures between all pairs of nodes in the structure of a network object, which can have both directional and non-directional links. The algorithm is based on the disjunctive addition of the elements of certain rows of the adjacency matrix, which models (describe) the structure of the original network object. The article formulates and proves a theorem that using such a procedure, the matrix of transitive closures of a network object can be obtained from the adjacency matrix in two iterations (traversal) on such an array. An estimate of the asymptotic computational complexity of the proposed algorithm is substantiated. The article presents the results of an experimental study of the execution time of such an algorithm on network structures of different dimensions and with different connection densities. For this indicator, the developed algorithm is compared with the well-known approaches of Bellman, Warshall-Floyd, Shimbel, which can also be used to determine the transitive closures of binary relations of network objects. The corresponding graphs of the obtained dependences are given. The proposed algorithm (the logic embedded in it) can become the basis for solving problems of monitoring the connectivity of various subscribers in data transmission networks in real time when managing the load in such networks, where the time spent on routing information flows directly depends on the execution time of control algorithms, as well as when solving other problems on the network structures.
Highlights
IN his activity, a person constantly collides with objects that have a network structure
The tasks of building the transitive closures (TC) binary relations arise in the field of logistics, control of the topology of transport communications, development and construction of large objects based on a network structure, management of information flows in data transmission networks, building queries to distributed databases and other areas
In this article we will show that TC of binary relations of the original graph can be constructed: firstly, for a significantly smaller number of traverses of the original adjacency matrix ( S 1 ); secondly, using only one array, which together leads to a decrease in the computational complexity of such an algorithm, as well as to a decrease in the used hardware resources – the memory of the computing system
Summary
IN his activity, a person constantly collides with objects that have a network structure. Quite often, these objects have a large number of nodes and connections between them. Individual elements of such objects can be located at a considerable distance from each other (be scattered over a large territory), which, when controlling the connectivity (reachability) of certain nodes, leads to the need to model such objects and solve some problems. The tasks of building the TC binary relations arise in the field of logistics, control of the topology of transport communications, development and construction of large objects based on a network structure, management of information flows in data transmission networks, building queries to distributed databases and other areas.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
