h' SrSSKrSSKJr SSKJr SS/r\"SS 5\RS S j55rS r \"SS 5\RS 55r g)z8Algorithms to calculate reciprocity in a directed graph.N) NetworkXError)not_implemented_for reciprocityoverall_reciprocity undirected multigraphcUc [U5$X;a'[[X55SnUc [S5eU$[ [X55$)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 Q/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/reciprocity.pyrr s\B }"1%% z,Q67:   AB B  !!+ ,,c#&# URU5nUHvn[URU55n[URU55nXE-n[ U5[ U5-nUS:XaUS4v M`S[ U5-U- nX84v Mx g7f)z*Return an iterator of (node, reciprocity).rNr) nbunch_iterset predecessors successorslen) rrnnodepredsuccoverlapn_totalrs rr r =s eA1>>$'(1<<%&+d)c$i' a<, c'l*W4K% %sBBcUR5nXR5R5- S-nUS:Xa [S5eX!- $)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 rrrOsK""$J ??#4#D#D#FF!KNQ:;;  &&r)N) __doc__networkxnxrutilsr__all__ _dispatchablerr rrrr+st>"' / 0\<0--1--`&$\<0'1'r