Abstract
The author discusses various methods of determining the shortest distances between fixed points in a given network and the use of algorithms is recommended since they can be implemented directly by computer. The solutions can be successfully applied to route selection in urban networks.