Computational graph theory for find out optimal routes of pipeline supply

In this paper are presented the application of graphs theory for determining the optimal route of a pipeline supply being at the great distance of the target consumer (pipeline network of a city). It applies when the distance from source to target, because the configuration of the land, there are several variants of the route passing through some mandatory points. In this way the route has n sections and on each section the total cost (investment plus operating for one year) has a certain value. If it can browse the route by more than two then the method becomes profitable. Implementation of the method is through a special program, using the Borland Pascal programming and Bellman-Kalaba algorithm. Mathematical resolving is by the matrix. Numbering the sections with 1 ... n, in order to obtain the final optimal browsing, it is the range of selected sections. In actual conditions when more and more sources of drinking water are becoming more polluted, the feeding is justified to be from remote mountain areas of the natural springs.