Development of the algorithm for the document coordination process in 1С: PLM 48
The main purpose of the article is to solve the classical problem of the graph theory designed for JSC «Research Institute «Submicron». The authors considered and worked out five different options, reviewed advantages and problems of each option. During work the problems were identified and the algorithm was developed to solve the All-Pairs Shortest Path (APSP) problem.