Compute the resource allocation index of all node pairs in ebunch.
Resource allocation index of \(u\) and \(v\) is defined as
where \(\Gamma(u)\) denotes the set of neighbors of \(u\).
Parameters: | G : graph
ebunch : iterable of node pairs, optional (default = None)
|
---|---|
Returns: | piter : iterator
|
References
[R266] | T. Zhou, L. Lu, Y.-C. Zhang. Predicting missing links via local information. Eur. Phys. J. B 71 (2009) 623. http://arxiv.org/pdf/0901.0553.pdf |
Examples
>>> import networkx as nx
>>> G = nx.complete_graph(5)
>>> preds = nx.resource_allocation_index(G, [(0, 1), (2, 3)])
>>> for u, v, p in preds:
... '(%d, %d) -> %.8f' % (u, v, p)
...
'(0, 1) -> 0.75000000'
'(2, 3) -> 0.75000000'