ó ÊðhñãóR•SrSSKJr SSKrS/r\R "SS9SSj5rg) z Vitality measures. é)ÚpartialNÚcloseness_vitalityÚweight)Ú edge_attrscóö•Uc[R"XS9nUb5[R"UR[U5U1- 5US9nX4- $[ [ XUS9nUVs0sH ofU"US9_M sn$s snf)añReturns the closeness vitality for nodes in the graph. The *closeness vitality* of a node, defined in Section 3.6.2 of [1], is the change in the sum of distances between all node pairs when excluding that node. Parameters ---------- G : NetworkX graph A strongly-connected graph. weight : string The name of the edge attribute used as weight. This is passed directly to the :func:`~networkx.wiener_index` function. node : object If specified, only the closeness vitality for this node will be returned. Otherwise, a dictionary mapping each node to its closeness vitality will be returned. Other parameters ---------------- wiener_index : number If you have already computed the Wiener index of the graph `G`, you can provide that value here. Otherwise, it will be computed for you. Returns ------- dictionary or float If `node` is None, this function returns a dictionary with nodes as keys and closeness vitality as the value. Otherwise, it returns only the closeness vitality for the specified `node`. The closeness vitality of a node may be negative infinity if removing that node would disconnect the graph. Examples -------- >>> G = nx.cycle_graph(3) >>> nx.closeness_vitality(G) {0: 2.0, 1: 2.0, 2: 2.0} See Also -------- closeness_centrality References ---------- .. [1] Ulrik Brandes, Thomas Erlebach (eds.). *Network Analysis: Methodological Foundations*. Springer, 2005. )r)rÚ wiener_index)Únode)ÚnxrÚsubgraphÚsetrr)ÚGr rrÚafterÚvitalityÚvs ÚN/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/vitality.pyrr sz€ðtÑÜ—’ qÑ8ˆ Ø ÑÜ—’ § ¡ ¬3¨q«6°T°F©?Ó ;ÀFÑKˆØÑ#Ð#ÜÔ)¨1È,ÑW€HÙ)*Ó +ª A‰x˜QÑÒ ©Ñ +Ð+ùÒ +sÁ#A6)NNN)Ú__doc__Ú functoolsrÚnetworkxr Ú__all__Ú _dispatchabler©órÚrs9ðñõãà Ð €ð×Ò˜XÑ&ó?,ó'ñ?,r