Affiliation:
1. Moscow aviation Institute (MAI)
2. Moscow Aviation Institute, (NRU MAI)
Abstract
The article presents an algorithm for solving the applied problem of assigning and moving locomotives, based on the solution of the graph–theoretic problem of covering the vertices of a directed graph with a set of oriented paths. A detailed example is given for an algorithm for covering the vertices of a directed graph with a set of maximal paths.
Publisher
Federal State-Financed Educational Institution of Higher Education Moscow State University of Psychology and Education