+ j' Rt^RIt^RIHt^RIHtRR.t]!RR4]PR Rl44tR t ]!RR4]PR 44t R#) z8Algorithms to calculate reciprocity in a directed graph.N) NetworkXError)not_implemented_for reciprocityoverall_reciprocity undirected multigraphcVf \V4#W9d-\\W44^,pVf \R4hV#\ \W44#)aCompute 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. zNot defined for isolated nodes.)rnext_reciprocity_iterrdict)Gnodesrs&& `/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/reciprocity.pyrr s\B }"1%% z,Q67:   AB B  !!+ ,,c#J"VPV4pVFp\VPV44p\VPV44pWE,p\ V4\ V4,pV^8Xd VR3xKi^\ V4,V, pW83xK R#5i)z*Return an iterator of (node, reciprocity).N) nbunch_iterset predecessors successorslen) r r nnodepredsuccoverlapn_totalrs && rr r =s eA1>>$'(1<<%&+d)c$i' a<, c'l*W4K% %sB!B#cVP4pWP4P4, ^,pV^8Xd \R4hW!, #)zCompute the reciprocity for the whole graph. See the doc of reciprocity for the definition. Parameters ---------- G : graph A networkx graph zNot defined for empty graphs)number_of_edges to_undirectedr)r n_all_edgen_overlap_edges& rrrOsK""$J ??#4#D#D#FF!KNQ:;;  &&r)N) __doc__networkxnxrutilsr__all__ _dispatchablerr rrrr(st>"' / 0\<0--1--`&$\<0'1'r