The software currently used by SDH net operators does not guarantee the automatic generation of routes between the selected nodes. This is the reason why the operators spend a lot of time on designing the nets manually. Despite all the time spent on designing, errors are still made which are the causes of net overload and connection disorders. It is necessary to convert the measuring units of SDH resources from a tree type structure to real numbers, because the structure of the analyzed object’s resource units is hierarchical. After evaluation of these units the solution of this problem can be found in theory of graphs. It is natural that given these data structures a special method is needed which would allow determining these structures and finding specific weight unit of edges of the graphs with which the problem is solved. The complexity of graph route composition algorithms is not satisfactory because the scope of real systems will be big enough. The amount of net nodes can exceed 500 and the amount of lines connecting them can be more than 5000. It is not very difficult to implement the automatic generation of routes in principle. The knowledge of graph theory can be used to do that. But in solving real problems with the best known methods of graph theory the time of solution is not acceptable because of the big scope of the problem. It is possible to reduce the time of solution by increasing the efficiency of the system that solves the problem. The need for more... [to full text]