where \(\Gamma(u)\) denotes the set of neighbors of \(u\).
This index leads to zero-division for nodes only connected via self-loops.
It is intended to be used when no self-loops are present.
G (graph) – NetworkX undirected graph.
ebunch (iterable of node pairs, optional (default = None)) – Adamic-Adar index will be computed for each pair of nodes given
in the iterable. The pairs must be given as 2-tuples (u, v)
where u and v are nodes in the graph. If ebunch is None then all
non-existent edges in the graph will be used.
Default value: None.
piter – An iterator of 3-tuples in the form (u, v, p) where (u, v) is a
pair of nodes and p is their Adamic-Adar index.