Algorithm for finding the optimal plan for solving a transport problem in network form

The problem of finding an optimal solution to the classical transport problem, which is reduced to a network form of dynamic programming, has been investigated. The conditions of the problem from the transport table are translated into a graph with vertices and edges with numerical data values. A specific example shows an algorithm for translating a method for obtaining a reference plan, a method for potentials of a task with a transport table, to a problem with a network graph. The distinctive features of the methods are indicated, the rules for searching for a reference plan in a network format are given. A solution to the problem was found, the solution was checked for optimality also using a network graph.