Development of a software module for constructing a scheme of laying cable routes on the basis of graph theory

This article analyzes the existing software applications used in the construction of schemes for laying cable routes. It is shown that such applications provide little functionality when optimizing route laying. In this study, we set out to create a software module based on an improved Dijkstra algorithm, which can be used in combination with the existing software. The developed module is capable of finding the shortest path when laying cable routes, taking into account logical and physical obstacles. The software module is implemented in Java and uses the concurrency module to parallelize calculations, thereby speeding up the process of calculating the optimal path.

Authors: L. A. Fedorichev, O. V. Bukunova

Direction: Informatics, Computer Technologies And Control

Keywords: cable route laying, Dijkstra's algorithm, shortest path finding, calculation parallelization, cable-supporting structure design, software development

---

View full article