ó žÃÒYc@s;dZddlZddlmZdgZdd„ZdS(s5Functions for computing the Voronoi cells of a graph.iÿÿÿÿN(tgroupst voronoi_cellstweightcCsgtj||d|ƒ}d„|jƒDƒ}t|ƒ}t|ƒt|ƒ}|rc||d>> G = nx.path_graph(6) >>> center_nodes = {0, 3} >>> cells = nx.voronoi_cells(G, center_nodes) >>> partition = set(map(frozenset, cells.values())) >>> sorted(map(sorted, partition)) [[0, 1], [2, 3, 4, 5]] Raises ------ ValueError If `center_nodes` is empty. References ---------- .. [1] Erwig, Martin. (2000), "The graph Voronoi diagram with applications." *Networks*, 36: 156--163. 3.0.CO;2-L> RcSs#i|]\}}|d|“qS(i((t.0tvtp((sq/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/voronoi.pys Us t unreachable(tnxtmulti_source_dijkstra_pathtitemsRtset(tGt center_nodesRtpathstnearesttcellsR((sq/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/voronoi.pyRsC  (t__doc__tnetworkxRtnetworkx.utilsRt__all__R(((sq/private/var/folders/w6/vb91730s7bb1k90y_rnhql1dhvdd44/T/pip-build-w4MwvS/networkx/networkx/algorithms/voronoi.pyt s