Determination of shortest route between plots and habitations with the aid network road’s graph and along borders of areas drives

key words:

Summary:

In article was presented the method of calculations distances of ground from habitations on base of numeric map. More in detail was discussed procedures concerning with shortest route from habitations to plots. Approach from habitation has been described for graph including road’s network and drives on field in complexes of areas. The route of drive from habitation to plots was defined as shortest path graph between its knots. Proper disparity of difficulty of drive after ways and after field was accepted. Introduced procedures have been processed at foundation concerning, that relocating proceed after borders of ways and after balks of plots. The graph describing relocate between single area and habitation usually does not surpass two thousand tops. It will not extend time of account excessively and economic application of processed method will enable. Served principles counting of distance and routes of drives allow from habitation for areas of farms on base of information map introduced in the form of numeric automation of majority computational procedure. This enables counting of distance of all rural plots from habitation of farms that can present valuable material for estimate of structure of village and its change. Table of distance of all plots can be taken at optimization of accommodation of ground in the village.

Citation:

Harasimowicz S., Janus J. 2006, vol. 3. Determination of shortest route between plots and habitations with the aid network road’s graph and along borders of areas drives. Infrastruktura i Ekologia Terenów Wiejskich. Nr 2006, vol. 3/ 2 (1)