networkx 2.8.2 Pypi GitHub Homepage
Other Docs
NotesParametersRaisesReturnsBackRef
hits(G, max_iter=100, tol=1e-08, nstart=None, normalized=True)

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.

Notes

The eigenvector calculation is done by the power iteration method and has no guarantee of convergence. The iteration will stop after max_iter iterations or an error tolerance of number_of_nodes(G)*tol has been reached.

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.

Parameters

G : graph

A NetworkX graph

max_iter : integer, optional

Maximum number of iterations in power method.

tol : float, optional

Error tolerance used to check convergence in power method iteration.

nstart : dictionary, optional

Starting value of each node for power method iteration.

normalized : bool (default=True)

Normalize results by the sum of all of the values.

Raises

PowerIterationFailedConvergence

If the algorithm fails to converge to the specified tolerance within the specified number of iterations of the power iteration method.

Returns

(hubs,authorities) : two-tuple of dictionaries

Two dictionaries keyed by node containing the hub and authority values.

Returns HITS hubs and authorities values for nodes.

Examples

>>> G = nx.path_graph(4)
... h, a = nx.hits(G)
See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.centrality.eigenvector.eigenvector_centrality_numpy networkx.algorithms.link_analysis.hits_alg.hits networkx.algorithms.centrality.katz.katz_centrality networkx.algorithms.centrality.eigenvector.eigenvector_centrality networkx.algorithms.centrality.katz.katz_centrality_numpy networkx.algorithms.link_analysis.hits_alg.hits_scipy

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /networkx/algorithms/link_analysis/hits_alg.py#8
type: <class 'function'>
Commit: