An economical algorithm for obtaining a shortest path through a single color connected graph

The problem of the shortest path through a graph is reduced to a Chinese postman problem with subproblems of obtaining the minimal perfect weighted matching, the largest matching, and Eulerian search. For the latter two economical algorithms are proposed, their convergence proved and effectiveness estimated. They reduce the load 'estimate of the entire problem.