In connection with the network realization problem the main questions of the algorithm are which edges to choose and what is the budget consequence of that. These problems can be solved by exact optimization methods, but in this case the number of computational steps (additions and comparisons) is an exponential function of the number of nodes. For this reason usually heuristic methods are chosen for solving these problems. Some special problems can be formulated as maximal flow problems. To get the solution we use only maximal flow and shortest route algorithms. Thus we decrease the number of computations, but the size of the network will grow. In this paper we describe this algorithm to solve the network realization problem. Then we give a transportation network realization problem and show how to solve this problem by the some algorithms. © 2009 IEEE.