Return HITS hubs and authorities values for nodes.
The HITS algorithm computes two numbers for a node. Authorities estimates the node value based on the incoming links. Hubs estimates the node value based on outgoing links.
- G (graph) – A NetworkX graph
- normalized (bool (default=True)) – Normalize results by the sum of all of the values.
(hubs,authorities) – Two dictionaries keyed by node containing the hub and authority values.
two-tuple of dictionaries
>>> G=nx.path_graph(4) >>> h,a=nx.hits(G)
The eigenvector calculation uses NumPy’s interface to LAPACK.
The HITS algorithm was designed for directed graphs but this algorithm does not check if the input graph is directed and will execute on undirected graphs.
 A. Langville and C. Meyer, “A survey of eigenvector methods of web information retrieval.” http://citeseer.ist.psu.edu/713792.html  Jon Kleinberg, Authoritative sources in a hyperlinked environment Journal of the ACM 46 (5): 604-32, 1999. doi:10.1145/324133.324140. http://www.cs.cornell.edu/home/kleinber/auth.pdf.