PROPERTIES OF HAMILTONIAN NETWORKS USED IN DEVELOPMENT OF SOFTWARE FOR SPECIAL-PURPOSE COMMUNICATION NETWORKS
Gorai Ivan Ivanovich, Zhuravlev Dmitrii Anatol'evich
S. M. Budjonny Military Academy of the Signal Corps in Saint Petersburg
Abstract. The article reveals the possibility of the development of the software used in the planning and operation of special-purpose networks. The focus of the authors’ attention is on the application of the designed for these purposes algorithm and code for solving the Travelling Salesman Problem, as well as the tester of evaluating the efficiency of their work. The paper gives the general properties of Hamiltonian networks allowing modifying original data in the process of the software testing.
Key words and phrases: алгоритм, программное обеспечение, задача "Коммивояжер", приближенное решение, тестирование, algorithm, software, Travelling Salesman Problem, approximate solution, testing
Open the whole article in PDF format. Free PDF-files viewer can be downloaded .
References:
Geri M., Dzhonson D. Vychislitel'nye mashiny i trudnoreshaemye zadachi / per. s angl. M.: Mir, 1982. 416 s.
Knut D. Iskusstvo programmirovaniya dlya EVM: v 3-kh t. M.: Mir, 1976. T. 1. Osnovnye algoritmy. 720 s.
Kristofidens N. Teoriya grafov. Algoritmicheskii podkhod. M.: Mir, 1978. 429 s.
Kuk S. A. Slozhnost' protsedur vyvoda teorem // Kiberneticheskii sbornik. Novaya seriya. 1975. Vyp. 12. S. 5-15.
Русский
