o ݐi' @sjdZddlZddlmZddlmZddgZedd ejdd dZd d Z edd ejd dZ dS)z8Algorithms to calculate reciprocity in a directed graph.N) NetworkXError)not_implemented_for reciprocityoverall_reciprocityZ undirectedZ multigraphcCsL|durt|S||vrtt||d}|durtd|Stt||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)Gnodesrr n/var/www/html/eduruby.in/lip-sync/lip-sync-env/lib/python3.10/site-packages/networkx/algorithms/reciprocity.pyr s!c cs|||}|D]3}t||}t||}||@}t|t|}|dkr.|dfVqdt||}||fVqdS)z*Return an iterator of (node, reciprocity).rNr)Z nbunch_itersetZ predecessors successorslen) r r nnodepredsuccoverlapZn_totalrr r rr =s   r cCs4|}||d}|dkrtd||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)Znumber_of_edgesZ to_undirectedr)r Z n_all_edgeZn_overlap_edger r rrOs  )N) __doc__Znetworkxnxrutilsr__all__Z _dispatchablerr rr r r rs  0