In these theses are pepresented the Voronoi diagram and Network Voronoi diagram. The shortest path Dijkstra’s algorithm was modified in this way that calculates shortest paths from several Voronoi generators at the same time. The first result - partition of the nodes of the network. The seond result - arcs of the network are attributed to the generators, considering especially their direction and asymmetric costs. Applications allow compare Network Voronoi diagrams to Voronoi diagrams. For this puspose we modified Fortune algorithm. We made particular product for Taxi depot. The user can make his own implementation.