ó |£*^c@sLdZddlZdjddgƒZdgZdd„Zdd„ZdS( s Vitality measures. iÿÿÿÿNs sAric Hagberg (hagberg@lanl.gov)s Renato Fabbritcloseness_vitalitycCs‘d}|dkrNxx|D].}tj||ƒ}|t|jƒƒ7}qWn?x<|D]4}tj||d|ƒ}|t|jƒƒ7}qUW|S(Ngtweight(tNonetnxt"single_source_shortest_path_lengthtsumtvaluest"single_source_dijkstra_path_length(tGRtweinertnt path_length((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/vitality.pyt weiner_indexs    cCsö|jƒ}t||ƒ}i}xÎ|D]Æ}|r€|j|dtdtƒ}|jƒr½||j|dtdtƒ7}q½n=|j|dtƒ}|jƒr½||j|dtƒ7}n|j|ƒ|t||ƒ||<|j|ƒq(W|S(sECompute closeness vitality for nodes. Closeness vitality of a node is the change in the sum of distances between all node pairs when excluding that node. Parameters ---------- G : graph weight : None or string (optional) The name of the edge attribute used as weight. If None the edge weights are ignored. Returns ------- nodes : dictionary Dictionary with nodes as keys and closeness vitality as the value. Examples -------- >>> G=nx.cycle_graph(3) >>> nx.closeness_vitality(G) {0: 4.0, 1: 4.0, 2: 4.0} See Also -------- closeness_centrality() References ---------- .. [1] Ulrik Brandes, Sec. 3.6.2 in Network Analysis: Methodological Foundations, Springer, 2005. http://books.google.com/books?id=TTNhSm7HYrIC tdatatkeys(t is_multigraphR tedgestTruet is_directedtin_edgestremove_edges_fromtadd_edges_from(RRt multigraphtwigRR R((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/vitality.pyRs#   %  ( t__doc__tnetworkxRtjoint __author__t__all__RR R(((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/vitality.pyts