The choice of route laying of optical cable is formalized as the issue of determination of a minimal and close to this paths in the graph. Modification of the Dijkstra's algorithm proposed to solve this problem. The route laying is shown on the electronic map of the city.