\Mh' dZddlZddlmZddlmZddgZedd ejd d Zd Z edd ejd Z dS)z8Algorithms to calculate reciprocity in a directed graph.N) NetworkXError)not_implemented_for reciprocityoverall_reciprocity undirected multigraphc|t|S||vr6tt||d}|td|St t||S)afCompute the reciprocity in a directed graph. The reciprocity of a directed graph is defined as the ratio of the number of edges pointing in both directions to the total number of edges in the graph. Formally, $r = |{(u,v) \in G|(v,u) \in G}| / |{(u,v) \in G}|$. The reciprocity of a single node u is defined similarly, it is the ratio of the number of edges in both directions to the total number of edges attached to node u. Parameters ---------- G : graph A networkx directed graph nodes : container of nodes, optional (default=whole graph) Compute reciprocity for nodes in this container. Returns ------- out : dictionary Reciprocity keyed by node label. Notes ----- The reciprocity is not defined for isolated nodes. In such cases this function will return None. NzNot defined for isolated nodes.)rnext_reciprocity_iterrdict)Gnodesrs _/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/networkx/algorithms/reciprocity.pyrr svB }"1%%% zz,Q6677:   ABB B  !!U++ , ,,c#^K||}|D]}t||}t||}||z}t |t |z}|dkr|dfVwdt |z|z }||fVdS)z*Return an iterator of (node, reciprocity).rNr) nbunch_iterset predecessors successorslen) rrnnodepredsuccoverlapn_totalrs rr r =s eA & &1>>$''((1<<%%&&+d))c$ii' a<<,    c'll*W4K% % % % % & &rc|}||z dz}|dkrtd||z S)zCompute the reciprocity for the whole graph. See the doc of reciprocity for the definition. Parameters ---------- G : graph A networkx graph rrzNot defined for empty graphs)number_of_edges to_undirectedr)r n_all_edgen_overlap_edges rrrOs]""$$J 1??#4#4#D#D#F#FF!KNQ:;;; J &&r)N) __doc__networkxnxrutilsr__all__ _dispatchablerr rrrr+s>>""""""'''''' / 0\<00------10--`&&&$\<00''10'''r